./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-subst.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/chl-simpl-str-subst.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 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:31:11,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:31:11,745 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:31:11,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:31:11,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:31:11,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:31:11,775 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:31:11,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:31:11,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:31:11,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:31:11,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:31:11,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:31:11,776 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:31:11,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:31:11,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:31:11,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:31:11,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:31:11,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:31:11,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:11,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:11,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:11,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:31:11,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:31:11,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:31:11,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:11,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:31:11,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:31:11,779 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 -> 58f1358e24877c92a149b6121e272e93974801203e91da3c444aa78d712ada40 [2025-01-09 21:31:12,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:31:12,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:31:12,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:31:12,025 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:31:12,025 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:31:12,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-01-09 21:31:13,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aecd37da2/898f07ded6e24ebf8a5a744be15a3ff8/FLAG92783879d [2025-01-09 21:31:13,351 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:31:13,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-subst.wvr.c [2025-01-09 21:31:13,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aecd37da2/898f07ded6e24ebf8a5a744be15a3ff8/FLAG92783879d [2025-01-09 21:31:13,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aecd37da2/898f07ded6e24ebf8a5a744be15a3ff8 [2025-01-09 21:31:13,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:31:13,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:31:13,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:13,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:31:13,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:31:13,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9de179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13, skipping insertion in model container [2025-01-09 21:31:13,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:31:13,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:13,850 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:31:13,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:31:13,884 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:31:13,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13 WrapperNode [2025-01-09 21:31:13,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:31:13,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:13,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:31:13,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:31:13,890 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:31:13" (1/1) ... [2025-01-09 21:31:13,895 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:31:13" (1/1) ... [2025-01-09 21:31:13,916 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 239 [2025-01-09 21:31:13,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:31:13,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:31:13,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:31:13,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:31:13,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:31:13,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:31:13,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:31:13,947 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:31:13,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (1/1) ... [2025-01-09 21:31:13,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:31:13,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:31:13,976 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:31:13,981 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:31:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:31:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:31:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:31:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:31:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:31:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:31:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:31:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:31:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:31:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:31:13,998 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:31:14,067 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:31:14,068 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:31:14,293 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:31:14,294 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:31:14,305 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:31:14,305 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:31:14,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:14 BoogieIcfgContainer [2025-01-09 21:31:14,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:31:14,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:31:14,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:31:14,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:31:14,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:31:13" (1/3) ... [2025-01-09 21:31:14,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88a9f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:14, skipping insertion in model container [2025-01-09 21:31:14,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:31:13" (2/3) ... [2025-01-09 21:31:14,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88a9f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:31:14, skipping insertion in model container [2025-01-09 21:31:14,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:14" (3/3) ... [2025-01-09 21:31:14,312 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2025-01-09 21:31:14,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:31:14,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-subst.wvr.c that has 4 procedures, 311 locations, 1 initial locations, 0 loop locations, and 29 error locations. [2025-01-09 21:31:14,325 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:31:14,436 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:31:14,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 325 transitions, 671 flow [2025-01-09 21:31:14,571 INFO L124 PetriNetUnfolderBase]: 15/322 cut-off events. [2025-01-09 21:31:14,573 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:31:14,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 322 events. 15/322 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 741 event pairs, 0 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2025-01-09 21:31:14,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 325 transitions, 671 flow [2025-01-09 21:31:14,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 299 places, 302 transitions, 622 flow [2025-01-09 21:31:14,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:31:14,618 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;@674f56c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:31:14,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-09 21:31:14,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:31:14,626 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-01-09 21:31:14,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:31:14,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:14,626 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] [2025-01-09 21:31:14,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:14,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash 182671358, now seen corresponding path program 1 times [2025-01-09 21:31:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375139915] [2025-01-09 21:31:14,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:14,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:14,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 21:31:14,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 21:31:14,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:14,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:14,787 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:31:14,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375139915] [2025-01-09 21:31:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375139915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:14,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:14,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798168324] [2025-01-09 21:31:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:14,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:14,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:14,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:14,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:14,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-01-09 21:31:14,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:14,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:14,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-01-09 21:31:14,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:14,995 INFO L124 PetriNetUnfolderBase]: 25/649 cut-off events. [2025-01-09 21:31:14,995 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:31:15,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 649 events. 25/649 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3260 event pairs, 7 based on Foata normal form. 22/566 useless extension candidates. Maximal degree in co-relation 514. Up to 25 conditions per place. [2025-01-09 21:31:15,005 INFO L140 encePairwiseOnDemand]: 315/325 looper letters, 11 selfloop transitions, 2 changer transitions 1/294 dead transitions. [2025-01-09 21:31:15,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 294 transitions, 632 flow [2025-01-09 21:31:15,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-01-09 21:31:15,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-01-09 21:31:15,021 INFO L175 Difference]: Start difference. First operand has 299 places, 302 transitions, 622 flow. Second operand 3 states and 924 transitions. [2025-01-09 21:31:15,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 294 transitions, 632 flow [2025-01-09 21:31:15,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 294 transitions, 620 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:31:15,032 INFO L231 Difference]: Finished difference. Result has 294 places, 293 transitions, 596 flow [2025-01-09 21:31:15,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=293} [2025-01-09 21:31:15,038 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -5 predicate places. [2025-01-09 21:31:15,038 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 293 transitions, 596 flow [2025-01-09 21:31:15,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:15,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,039 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] [2025-01-09 21:31:15,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:31:15,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:15,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1666545074, now seen corresponding path program 1 times [2025-01-09 21:31:15,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099692680] [2025-01-09 21:31:15,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:31:15,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:31:15,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,090 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:31:15,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099692680] [2025-01-09 21:31:15,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099692680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246539210] [2025-01-09 21:31:15,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-01-09 21:31:15,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:15,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-01-09 21:31:15,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,199 INFO L124 PetriNetUnfolderBase]: 21/551 cut-off events. [2025-01-09 21:31:15,199 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-01-09 21:31:15,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 551 events. 21/551 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2526 event pairs, 7 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 555. Up to 25 conditions per place. [2025-01-09 21:31:15,203 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-01-09 21:31:15,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 292 transitions, 620 flow [2025-01-09 21:31:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-01-09 21:31:15,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2025-01-09 21:31:15,206 INFO L175 Difference]: Start difference. First operand has 294 places, 293 transitions, 596 flow. Second operand 3 states and 917 transitions. [2025-01-09 21:31:15,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 292 transitions, 620 flow [2025-01-09 21:31:15,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 292 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:15,210 INFO L231 Difference]: Finished difference. Result has 292 places, 292 transitions, 594 flow [2025-01-09 21:31:15,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=292, PETRI_TRANSITIONS=292} [2025-01-09 21:31:15,211 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -7 predicate places. [2025-01-09 21:31:15,211 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 292 transitions, 594 flow [2025-01-09 21:31:15,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:15,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:15,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:31:15,213 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -2079277513, now seen corresponding path program 1 times [2025-01-09 21:31:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193355530] [2025-01-09 21:31:15,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:31:15,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:31:15,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,269 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:31:15,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193355530] [2025-01-09 21:31:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193355530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236734919] [2025-01-09 21:31:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-01-09 21:31:15,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 292 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:31:15,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-01-09 21:31:15,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,391 INFO L124 PetriNetUnfolderBase]: 20/460 cut-off events. [2025-01-09 21:31:15,391 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:31:15,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 460 events. 20/460 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1954 event pairs, 8 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 460. Up to 29 conditions per place. [2025-01-09 21:31:15,395 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-01-09 21:31:15,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 291 transitions, 620 flow [2025-01-09 21:31:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2025-01-09 21:31:15,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384615384615385 [2025-01-09 21:31:15,400 INFO L175 Difference]: Start difference. First operand has 292 places, 292 transitions, 594 flow. Second operand 3 states and 915 transitions. [2025-01-09 21:31:15,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 291 transitions, 620 flow [2025-01-09 21:31:15,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 291 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:15,421 INFO L231 Difference]: Finished difference. Result has 291 places, 291 transitions, 592 flow [2025-01-09 21:31:15,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=289, 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=592, PETRI_PLACES=291, PETRI_TRANSITIONS=291} [2025-01-09 21:31:15,423 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -8 predicate places. [2025-01-09 21:31:15,423 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 291 transitions, 592 flow [2025-01-09 21:31:15,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:31:15,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:15,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:31:15,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:15,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1640872581, now seen corresponding path program 1 times [2025-01-09 21:31:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005247365] [2025-01-09 21:31:15,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:31:15,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:31:15,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,462 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:31:15,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005247365] [2025-01-09 21:31:15,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005247365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819641595] [2025-01-09 21:31:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-01-09 21:31:15,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 291 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:15,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-01-09 21:31:15,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,548 INFO L124 PetriNetUnfolderBase]: 15/424 cut-off events. [2025-01-09 21:31:15,548 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:31:15,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 424 events. 15/424 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1661 event pairs, 5 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 407. Up to 22 conditions per place. [2025-01-09 21:31:15,552 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-01-09 21:31:15,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 290 transitions, 616 flow [2025-01-09 21:31:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-01-09 21:31:15,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2025-01-09 21:31:15,555 INFO L175 Difference]: Start difference. First operand has 291 places, 291 transitions, 592 flow. Second operand 3 states and 917 transitions. [2025-01-09 21:31:15,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 290 transitions, 616 flow [2025-01-09 21:31:15,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 290 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:15,558 INFO L231 Difference]: Finished difference. Result has 290 places, 290 transitions, 590 flow [2025-01-09 21:31:15,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=288, 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=590, PETRI_PLACES=290, PETRI_TRANSITIONS=290} [2025-01-09 21:31:15,559 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2025-01-09 21:31:15,559 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 290 transitions, 590 flow [2025-01-09 21:31:15,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:15,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:15,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:31:15,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2125481100, now seen corresponding path program 1 times [2025-01-09 21:31:15,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902711007] [2025-01-09 21:31:15,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:31:15,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:31:15,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,602 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:31:15,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902711007] [2025-01-09 21:31:15,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902711007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954436246] [2025-01-09 21:31:15,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 325 [2025-01-09 21:31:15,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 290 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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:31:15,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 325 [2025-01-09 21:31:15,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,711 INFO L124 PetriNetUnfolderBase]: 42/733 cut-off events. [2025-01-09 21:31:15,711 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2025-01-09 21:31:15,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 733 events. 42/733 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3774 event pairs, 20 based on Foata normal form. 0/626 useless extension candidates. Maximal degree in co-relation 736. Up to 50 conditions per place. [2025-01-09 21:31:15,717 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-01-09 21:31:15,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 289 transitions, 618 flow [2025-01-09 21:31:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2025-01-09 21:31:15,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364102564102564 [2025-01-09 21:31:15,721 INFO L175 Difference]: Start difference. First operand has 290 places, 290 transitions, 590 flow. Second operand 3 states and 913 transitions. [2025-01-09 21:31:15,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 289 transitions, 618 flow [2025-01-09 21:31:15,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 289 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:15,725 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 588 flow [2025-01-09 21:31:15,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=287, 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=588, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2025-01-09 21:31:15,726 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2025-01-09 21:31:15,726 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 588 flow [2025-01-09 21:31:15,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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:31:15,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,729 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] [2025-01-09 21:31:15,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:31:15,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:15,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash 372904994, now seen corresponding path program 1 times [2025-01-09 21:31:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612534207] [2025-01-09 21:31:15,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:31:15,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:31:15,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,761 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:31:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612534207] [2025-01-09 21:31:15,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612534207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719319934] [2025-01-09 21:31:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 325 [2025-01-09 21:31:15,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:15,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 325 [2025-01-09 21:31:15,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,829 INFO L124 PetriNetUnfolderBase]: 15/361 cut-off events. [2025-01-09 21:31:15,829 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-01-09 21:31:15,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 361 events. 15/361 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1268 event pairs, 7 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 330. Up to 25 conditions per place. [2025-01-09 21:31:15,832 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-01-09 21:31:15,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 288 transitions, 612 flow [2025-01-09 21:31:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 917 transitions. [2025-01-09 21:31:15,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9405128205128205 [2025-01-09 21:31:15,834 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 588 flow. Second operand 3 states and 917 transitions. [2025-01-09 21:31:15,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 288 transitions, 612 flow [2025-01-09 21:31:15,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 288 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:15,838 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 586 flow [2025-01-09 21:31:15,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2025-01-09 21:31:15,840 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-01-09 21:31:15,840 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 586 flow [2025-01-09 21:31:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 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:31:15,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,841 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:15,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:31:15,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:15,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash 91897490, now seen corresponding path program 1 times [2025-01-09 21:31:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049744590] [2025-01-09 21:31:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 21:31:15,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 21:31:15,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,906 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:31:15,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049744590] [2025-01-09 21:31:15,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049744590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744338095] [2025-01-09 21:31:15,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:15,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:31:15,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:15,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:16,010 INFO L124 PetriNetUnfolderBase]: 46/884 cut-off events. [2025-01-09 21:31:16,010 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:16,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 884 events. 46/884 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5573 event pairs, 12 based on Foata normal form. 0/751 useless extension candidates. Maximal degree in co-relation 875. Up to 43 conditions per place. [2025-01-09 21:31:16,018 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 13 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2025-01-09 21:31:16,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 290 transitions, 622 flow [2025-01-09 21:31:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-01-09 21:31:16,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2025-01-09 21:31:16,020 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 586 flow. Second operand 3 states and 926 transitions. [2025-01-09 21:31:16,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 290 transitions, 622 flow [2025-01-09 21:31:16,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:16,026 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 592 flow [2025-01-09 21:31:16,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2025-01-09 21:31:16,027 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-01-09 21:31:16,027 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 592 flow [2025-01-09 21:31:16,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:31:16,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:16,028 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] [2025-01-09 21:31:16,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:31:16,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:16,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1824695897, now seen corresponding path program 1 times [2025-01-09 21:31:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243168097] [2025-01-09 21:31:16,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:16,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:31:16,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:31:16,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:16,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:16,086 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:31:16,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243168097] [2025-01-09 21:31:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243168097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:16,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:16,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:16,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753806863] [2025-01-09 21:31:16,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:16,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:16,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:16,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:16,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:16,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 325 [2025-01-09 21:31:16,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:31:16,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:16,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 325 [2025-01-09 21:31:16,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:16,192 INFO L124 PetriNetUnfolderBase]: 45/803 cut-off events. [2025-01-09 21:31:16,193 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:16,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 803 events. 45/803 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4856 event pairs, 10 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 733. Up to 49 conditions per place. [2025-01-09 21:31:16,201 INFO L140 encePairwiseOnDemand]: 319/325 looper letters, 15 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2025-01-09 21:31:16,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 634 flow [2025-01-09 21:31:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-01-09 21:31:16,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2025-01-09 21:31:16,203 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 592 flow. Second operand 3 states and 921 transitions. [2025-01-09 21:31:16,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 634 flow [2025-01-09 21:31:16,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 290 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:16,207 INFO L231 Difference]: Finished difference. Result has 287 places, 288 transitions, 607 flow [2025-01-09 21:31:16,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=287, PETRI_TRANSITIONS=288} [2025-01-09 21:31:16,208 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-01-09 21:31:16,208 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 288 transitions, 607 flow [2025-01-09 21:31:16,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 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:31:16,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:16,208 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] [2025-01-09 21:31:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:31:16,209 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1855236869, now seen corresponding path program 1 times [2025-01-09 21:31:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208252652] [2025-01-09 21:31:16,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:16,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:31:16,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:31:16,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:16,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:16,237 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:31:16,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:16,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208252652] [2025-01-09 21:31:16,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208252652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:16,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:16,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:16,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657713795] [2025-01-09 21:31:16,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:16,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:16,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:16,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:16,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:16,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:16,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 288 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:31:16,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:16,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:16,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:16,353 INFO L124 PetriNetUnfolderBase]: 38/959 cut-off events. [2025-01-09 21:31:16,353 INFO L125 PetriNetUnfolderBase]: For 7/11 co-relation queries the response was YES. [2025-01-09 21:31:16,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 959 events. 38/959 cut-off events. For 7/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5918 event pairs, 4 based on Foata normal form. 1/853 useless extension candidates. Maximal degree in co-relation 847. Up to 53 conditions per place. [2025-01-09 21:31:16,360 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-01-09 21:31:16,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 293 transitions, 658 flow [2025-01-09 21:31:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-01-09 21:31:16,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2025-01-09 21:31:16,362 INFO L175 Difference]: Start difference. First operand has 287 places, 288 transitions, 607 flow. Second operand 3 states and 929 transitions. [2025-01-09 21:31:16,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 293 transitions, 658 flow [2025-01-09 21:31:16,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 293 transitions, 658 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:16,365 INFO L231 Difference]: Finished difference. Result has 288 places, 288 transitions, 617 flow [2025-01-09 21:31:16,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=617, PETRI_PLACES=288, PETRI_TRANSITIONS=288} [2025-01-09 21:31:16,366 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-01-09 21:31:16,366 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 288 transitions, 617 flow [2025-01-09 21:31:16,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:31:16,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:16,367 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] [2025-01-09 21:31:16,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:31:16,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash -471178849, now seen corresponding path program 1 times [2025-01-09 21:31:16,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:16,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220039622] [2025-01-09 21:31:16,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:16,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:16,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:31:16,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:31:16,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:16,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:16,395 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:31:16,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:16,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220039622] [2025-01-09 21:31:16,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220039622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:16,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:16,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910237365] [2025-01-09 21:31:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:16,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:16,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:16,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:16,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:16,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:16,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 288 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:31:16,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:16,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:16,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:16,492 INFO L124 PetriNetUnfolderBase]: 33/1027 cut-off events. [2025-01-09 21:31:16,492 INFO L125 PetriNetUnfolderBase]: For 15/25 co-relation queries the response was YES. [2025-01-09 21:31:16,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1027 events. 33/1027 cut-off events. For 15/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5838 event pairs, 4 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 965. Up to 51 conditions per place. [2025-01-09 21:31:16,500 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 16 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-01-09 21:31:16,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 293 transitions, 668 flow [2025-01-09 21:31:16,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2025-01-09 21:31:16,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528205128205128 [2025-01-09 21:31:16,502 INFO L175 Difference]: Start difference. First operand has 288 places, 288 transitions, 617 flow. Second operand 3 states and 929 transitions. [2025-01-09 21:31:16,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 293 transitions, 668 flow [2025-01-09 21:31:16,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:16,505 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 627 flow [2025-01-09 21:31:16,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2025-01-09 21:31:16,506 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2025-01-09 21:31:16,506 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 627 flow [2025-01-09 21:31:16,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 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:31:16,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:16,506 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] [2025-01-09 21:31:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:31:16,507 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:16,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:16,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1134306589, now seen corresponding path program 1 times [2025-01-09 21:31:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005368054] [2025-01-09 21:31:16,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:16,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:31:16,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:31:16,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:16,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:16,530 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:31:16,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:16,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005368054] [2025-01-09 21:31:16,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005368054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:16,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:16,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:16,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888507913] [2025-01-09 21:31:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:16,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:16,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:16,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:16,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 325 [2025-01-09 21:31:16,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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:31:16,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:16,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 325 [2025-01-09 21:31:16,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:16,619 INFO L124 PetriNetUnfolderBase]: 34/997 cut-off events. [2025-01-09 21:31:16,619 INFO L125 PetriNetUnfolderBase]: For 4/17 co-relation queries the response was YES. [2025-01-09 21:31:16,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 997 events. 34/997 cut-off events. For 4/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5841 event pairs, 8 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 965. Up to 38 conditions per place. [2025-01-09 21:31:16,628 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 11 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2025-01-09 21:31:16,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 289 transitions, 657 flow [2025-01-09 21:31:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2025-01-09 21:31:16,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497435897435897 [2025-01-09 21:31:16,630 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 627 flow. Second operand 3 states and 926 transitions. [2025-01-09 21:31:16,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 289 transitions, 657 flow [2025-01-09 21:31:16,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 289 transitions, 657 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:16,633 INFO L231 Difference]: Finished difference. Result has 290 places, 287 transitions, 629 flow [2025-01-09 21:31:16,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=625, 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=629, PETRI_PLACES=290, PETRI_TRANSITIONS=287} [2025-01-09 21:31:16,634 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -9 predicate places. [2025-01-09 21:31:16,634 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 287 transitions, 629 flow [2025-01-09 21:31:16,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.3333333333333) internal successors, (916), 3 states have internal predecessors, (916), 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:31:16,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:16,634 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] [2025-01-09 21:31:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:31:16,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:16,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2083931817, now seen corresponding path program 1 times [2025-01-09 21:31:16,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:16,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332004460] [2025-01-09 21:31:16,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:16,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:16,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:31:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:31:16,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:16,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:16,657 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:31:16,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:16,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332004460] [2025-01-09 21:31:16,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332004460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:16,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:16,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056529475] [2025-01-09 21:31:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:16,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:16,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:16,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:16,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 325 [2025-01-09 21:31:16,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 287 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 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:31:16,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:16,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 325 [2025-01-09 21:31:16,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:16,863 INFO L124 PetriNetUnfolderBase]: 226/2802 cut-off events. [2025-01-09 21:31:16,863 INFO L125 PetriNetUnfolderBase]: For 71/221 co-relation queries the response was YES. [2025-01-09 21:31:16,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2802 events. 226/2802 cut-off events. For 71/221 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25428 event pairs, 100 based on Foata normal form. 1/2502 useless extension candidates. Maximal degree in co-relation 2762. Up to 329 conditions per place. [2025-01-09 21:31:16,882 INFO L140 encePairwiseOnDemand]: 317/325 looper letters, 17 selfloop transitions, 4 changer transitions 0/289 dead transitions. [2025-01-09 21:31:16,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 677 flow [2025-01-09 21:31:16,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 916 transitions. [2025-01-09 21:31:16,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9394871794871795 [2025-01-09 21:31:16,885 INFO L175 Difference]: Start difference. First operand has 290 places, 287 transitions, 629 flow. Second operand 3 states and 916 transitions. [2025-01-09 21:31:16,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 677 flow [2025-01-09 21:31:16,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:16,888 INFO L231 Difference]: Finished difference. Result has 287 places, 287 transitions, 645 flow [2025-01-09 21:31:16,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=287, PETRI_TRANSITIONS=287} [2025-01-09 21:31:16,889 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-01-09 21:31:16,889 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 287 transitions, 645 flow [2025-01-09 21:31:16,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.6666666666667) internal successors, (896), 3 states have internal predecessors, (896), 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:31:16,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:16,890 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:31:16,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:31:16,890 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:16,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2005244654, now seen corresponding path program 1 times [2025-01-09 21:31:16,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:16,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866848486] [2025-01-09 21:31:16,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:16,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:31:16,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:31:16,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:16,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:16,914 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:31:16,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:16,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866848486] [2025-01-09 21:31:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866848486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:16,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:16,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158651863] [2025-01-09 21:31:16,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:16,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:16,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:16,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:16,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:16,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 287 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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:31:16,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:16,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:16,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:17,149 INFO L124 PetriNetUnfolderBase]: 108/2656 cut-off events. [2025-01-09 21:31:17,149 INFO L125 PetriNetUnfolderBase]: For 36/42 co-relation queries the response was YES. [2025-01-09 21:31:17,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 2656 events. 108/2656 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 23423 event pairs, 14 based on Foata normal form. 0/2405 useless extension candidates. Maximal degree in co-relation 2473. Up to 164 conditions per place. [2025-01-09 21:31:17,164 INFO L140 encePairwiseOnDemand]: 321/325 looper letters, 15 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-01-09 21:31:17,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 691 flow [2025-01-09 21:31:17,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-01-09 21:31:17,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-01-09 21:31:17,167 INFO L175 Difference]: Start difference. First operand has 287 places, 287 transitions, 645 flow. Second operand 3 states and 928 transitions. [2025-01-09 21:31:17,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 691 flow [2025-01-09 21:31:17,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 291 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:17,170 INFO L231 Difference]: Finished difference. Result has 288 places, 287 transitions, 655 flow [2025-01-09 21:31:17,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=287} [2025-01-09 21:31:17,172 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-01-09 21:31:17,172 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 287 transitions, 655 flow [2025-01-09 21:31:17,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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:31:17,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:17,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:17,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:31:17,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:17,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -684237204, now seen corresponding path program 1 times [2025-01-09 21:31:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642853824] [2025-01-09 21:31:17,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:17,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:31:17,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:31:17,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:17,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:17,227 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:31:17,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:17,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642853824] [2025-01-09 21:31:17,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642853824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:17,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:17,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:17,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085617641] [2025-01-09 21:31:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:17,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:17,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:17,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:17,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:17,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:17,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 287 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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:31:17,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:17,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:17,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:17,519 INFO L124 PetriNetUnfolderBase]: 97/2277 cut-off events. [2025-01-09 21:31:17,519 INFO L125 PetriNetUnfolderBase]: For 24/60 co-relation queries the response was YES. [2025-01-09 21:31:17,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2277 events. 97/2277 cut-off events. For 24/60 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 19422 event pairs, 18 based on Foata normal form. 2/2073 useless extension candidates. Maximal degree in co-relation 2097. Up to 73 conditions per place. [2025-01-09 21:31:17,533 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-01-09 21:31:17,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 687 flow [2025-01-09 21:31:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-01-09 21:31:17,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-01-09 21:31:17,538 INFO L175 Difference]: Start difference. First operand has 288 places, 287 transitions, 655 flow. Second operand 3 states and 924 transitions. [2025-01-09 21:31:17,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 687 flow [2025-01-09 21:31:17,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 687 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:17,543 INFO L231 Difference]: Finished difference. Result has 289 places, 286 transitions, 657 flow [2025-01-09 21:31:17,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=289, PETRI_TRANSITIONS=286} [2025-01-09 21:31:17,545 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -10 predicate places. [2025-01-09 21:31:17,545 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 286 transitions, 657 flow [2025-01-09 21:31:17,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 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:31:17,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:17,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:17,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:31:17,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:17,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:17,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1908473204, now seen corresponding path program 1 times [2025-01-09 21:31:17,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:17,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941404837] [2025-01-09 21:31:17,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:17,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:17,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:31:17,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:31:17,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:17,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:17,599 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:31:17,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:17,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941404837] [2025-01-09 21:31:17,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941404837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:17,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:17,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:17,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732995814] [2025-01-09 21:31:17,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:17,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:17,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:17,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:17,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:17,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 286 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 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:31:17,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:17,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:17,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:17,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([850] L55-25-->L55-26: Formula: true InVars {} OutVars{thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~nondet12#1][181], [Black: 349#true, 368#true, 24#L55-26true, Black: 353#true, 362#(= |#race~length_4~0| 0), 70#L76true, 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 351#(= |#race~to_int_1~0| 0), 371#true, Black: 345#true, 355#(= |#race~to_int_3~0| 0)]) [2025-01-09 21:31:17,785 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is not cut-off event [2025-01-09 21:31:17,785 INFO L297 olderBase$Statistics]: existing Event has 215 ancestors and is not cut-off event [2025-01-09 21:31:17,785 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-01-09 21:31:17,785 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is not cut-off event [2025-01-09 21:31:17,788 INFO L124 PetriNetUnfolderBase]: 131/1723 cut-off events. [2025-01-09 21:31:17,788 INFO L125 PetriNetUnfolderBase]: For 86/123 co-relation queries the response was YES. [2025-01-09 21:31:17,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1723 events. 131/1723 cut-off events. For 86/123 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14175 event pairs, 36 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1885. Up to 169 conditions per place. [2025-01-09 21:31:17,799 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 12 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-01-09 21:31:17,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 287 transitions, 689 flow [2025-01-09 21:31:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-01-09 21:31:17,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9476923076923077 [2025-01-09 21:31:17,801 INFO L175 Difference]: Start difference. First operand has 289 places, 286 transitions, 657 flow. Second operand 3 states and 924 transitions. [2025-01-09 21:31:17,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 287 transitions, 689 flow [2025-01-09 21:31:17,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 287 transitions, 685 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:17,805 INFO L231 Difference]: Finished difference. Result has 288 places, 285 transitions, 655 flow [2025-01-09 21:31:17,806 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=288, PETRI_TRANSITIONS=285} [2025-01-09 21:31:17,807 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -11 predicate places. [2025-01-09 21:31:17,807 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 285 transitions, 655 flow [2025-01-09 21:31:17,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 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:31:17,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:17,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:17,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:31:17,807 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:17,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2108863995, now seen corresponding path program 1 times [2025-01-09 21:31:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:17,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494966887] [2025-01-09 21:31:17,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:17,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:31:17,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:31:17,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:17,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:17,856 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:31:17,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494966887] [2025-01-09 21:31:17,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494966887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:17,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:17,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:17,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973648656] [2025-01-09 21:31:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:17,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:17,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:17,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:17,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:17,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 325 [2025-01-09 21:31:17,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 285 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 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:31:17,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:17,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 325 [2025-01-09 21:31:17,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:18,022 INFO L124 PetriNetUnfolderBase]: 68/2037 cut-off events. [2025-01-09 21:31:18,022 INFO L125 PetriNetUnfolderBase]: For 8/20 co-relation queries the response was YES. [2025-01-09 21:31:18,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2397 conditions, 2037 events. 68/2037 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 16336 event pairs, 4 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2046. Up to 66 conditions per place. [2025-01-09 21:31:18,031 INFO L140 encePairwiseOnDemand]: 323/325 looper letters, 8 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2025-01-09 21:31:18,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 284 transitions, 671 flow [2025-01-09 21:31:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-01-09 21:31:18,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9517948717948718 [2025-01-09 21:31:18,033 INFO L175 Difference]: Start difference. First operand has 288 places, 285 transitions, 655 flow. Second operand 3 states and 928 transitions. [2025-01-09 21:31:18,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 284 transitions, 671 flow [2025-01-09 21:31:18,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:18,037 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 651 flow [2025-01-09 21:31:18,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=651, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2025-01-09 21:31:18,038 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -12 predicate places. [2025-01-09 21:31:18,038 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 651 flow [2025-01-09 21:31:18,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 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:31:18,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:18,038 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] [2025-01-09 21:31:18,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:31:18,038 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:18,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1653121731, now seen corresponding path program 1 times [2025-01-09 21:31:18,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:18,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305387998] [2025-01-09 21:31:18,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:18,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:18,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 21:31:18,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 21:31:18,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:18,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:18,081 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:31:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:18,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305387998] [2025-01-09 21:31:18,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305387998] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:18,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:18,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650785140] [2025-01-09 21:31:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:18,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:18,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:18,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:18,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:18,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 651 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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:31:18,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:18,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:18,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:18,232 INFO L124 PetriNetUnfolderBase]: 70/2113 cut-off events. [2025-01-09 21:31:18,232 INFO L125 PetriNetUnfolderBase]: For 8/22 co-relation queries the response was YES. [2025-01-09 21:31:18,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 2113 events. 70/2113 cut-off events. For 8/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17249 event pairs, 9 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 2290. Up to 70 conditions per place. [2025-01-09 21:31:18,245 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2025-01-09 21:31:18,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 282 transitions, 669 flow [2025-01-09 21:31:18,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:18,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 922 transitions. [2025-01-09 21:31:18,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456410256410256 [2025-01-09 21:31:18,247 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 651 flow. Second operand 3 states and 922 transitions. [2025-01-09 21:31:18,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 282 transitions, 669 flow [2025-01-09 21:31:18,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 282 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:18,250 INFO L231 Difference]: Finished difference. Result has 286 places, 282 transitions, 648 flow [2025-01-09 21:31:18,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=646, 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=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=286, PETRI_TRANSITIONS=282} [2025-01-09 21:31:18,251 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -13 predicate places. [2025-01-09 21:31:18,251 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 282 transitions, 648 flow [2025-01-09 21:31:18,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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:31:18,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:18,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:18,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:31:18,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2025-01-09 21:31:18,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1638243199, now seen corresponding path program 1 times [2025-01-09 21:31:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:18,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317474921] [2025-01-09 21:31:18,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:18,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:18,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:31:18,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:31:18,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:18,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:18,300 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:31:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:18,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317474921] [2025-01-09 21:31:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317474921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:18,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:18,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:18,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48084068] [2025-01-09 21:31:18,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:18,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:18,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:18,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:18,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:18,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 325 [2025-01-09 21:31:18,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 282 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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:31:18,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:18,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 325 [2025-01-09 21:31:18,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:18,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([854] L55-26-->L55-27: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_8~0=|v_#race~result_8~0_1|, thread3Thread1of1ForFork0_#t~nondet12#1=|v_thread3Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_8~0][187], [Black: 349#true, Black: 353#true, 362#(= |#race~length_4~0| 0), 70#L76true, 366#(= |#race~to_int_5~0| 0), Black: 360#true, 343#(= |#race~length_0~0| 0), Black: 364#true, 347#(= |#race~length_2~0| 0), Black: 341#true, 380#true, 351#(= |#race~to_int_1~0| 0), 377#true, Black: 345#true, 89#L55-27true, 355#(= |#race~to_int_3~0| 0)]) [2025-01-09 21:31:18,431 INFO L294 olderBase$Statistics]: this new event has 216 ancestors and is cut-off event [2025-01-09 21:31:18,431 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:31:18,431 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:31:18,431 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:31:18,433 INFO L124 PetriNetUnfolderBase]: 68/1516 cut-off events. [2025-01-09 21:31:18,433 INFO L125 PetriNetUnfolderBase]: For 20/36 co-relation queries the response was YES. [2025-01-09 21:31:18,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1516 events. 68/1516 cut-off events. For 20/36 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11442 event pairs, 18 based on Foata normal form. 5/1415 useless extension candidates. Maximal degree in co-relation 1719. Up to 89 conditions per place. [2025-01-09 21:31:18,439 INFO L140 encePairwiseOnDemand]: 322/325 looper letters, 0 selfloop transitions, 0 changer transitions 280/280 dead transitions. [2025-01-09 21:31:18,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 280 transitions, 664 flow [2025-01-09 21:31:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2025-01-09 21:31:18,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9446153846153846 [2025-01-09 21:31:18,440 INFO L175 Difference]: Start difference. First operand has 286 places, 282 transitions, 648 flow. Second operand 3 states and 921 transitions. [2025-01-09 21:31:18,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 280 transitions, 664 flow [2025-01-09 21:31:18,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 280 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:18,443 INFO L231 Difference]: Finished difference. Result has 285 places, 0 transitions, 0 flow [2025-01-09 21:31:18,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=285, PETRI_TRANSITIONS=0} [2025-01-09 21:31:18,444 INFO L279 CegarLoopForPetriNet]: 299 programPoint places, -14 predicate places. [2025-01-09 21:31:18,444 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 0 transitions, 0 flow [2025-01-09 21:31:18,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2025-01-09 21:31:18,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2025-01-09 21:31:18,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2025-01-09 21:31:18,449 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2025-01-09 21:31:18,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2025-01-09 21:31:18,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:31:18,451 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:18,455 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:31:18,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:31:18,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:31:18 BasicIcfg [2025-01-09 21:31:18,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:31:18,459 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:31:18,459 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:31:18,459 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:31:18,459 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:31:14" (3/4) ... [2025-01-09 21:31:18,460 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:31:18,464 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:31:18,464 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:31:18,464 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:31:18,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 21:31:18,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:31:18,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:31:18,469 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:31:18,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:31:18,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:31:18,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:31:18,532 INFO L158 Benchmark]: Toolchain (without parser) took 4824.74ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.4MB in the beginning and 352.1MB in the end (delta: -238.7MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2025-01-09 21:31:18,532 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:18,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.64ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:18,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.51ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:18,533 INFO L158 Benchmark]: Boogie Preprocessor took 28.03ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.8MB in the end (delta: 994.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:31:18,534 INFO L158 Benchmark]: RCFGBuilder took 358.51ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 75.7MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:31:18,534 INFO L158 Benchmark]: TraceAbstraction took 4151.65ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 74.6MB in the beginning and 360.5MB in the end (delta: -285.9MB). Peak memory consumption was 212.5MB. Max. memory is 16.1GB. [2025-01-09 21:31:18,534 INFO L158 Benchmark]: Witness Printer took 72.20ms. Allocated memory is still 427.8MB. Free memory was 360.5MB in the beginning and 352.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:31:18,535 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.64ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.2MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.51ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.03ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.8MB in the end (delta: 994.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 358.51ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 75.7MB in the end (delta: 23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4151.65ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 74.6MB in the beginning and 360.5MB in the end (delta: -285.9MB). Peak memory consumption was 212.5MB. Max. memory is 16.1GB. * Witness Printer took 72.20ms. Allocated memory is still 427.8MB. Free memory was 360.5MB in the beginning and 352.1MB 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: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 488 locations, 50 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: 4.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 485 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 87 mSDtfsCounter, 485 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=657occurred in iteration=14, InterpolantAutomatonStates: 54, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1477 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1459 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:31:18,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE