./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:05:00,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:05:00,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:05:00,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:05:00,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:05:00,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:05:00,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:05:00,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:05:00,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:05:00,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:05:00,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:05:00,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:05:00,675 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:05:00,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:05:00,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:05:00,677 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:05:00,677 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:05:00,677 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:05:00,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:05:00,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:05:00,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:05:00,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:05:00,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:05:00,678 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-03-08 22:05:00,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:05:00,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:05:00,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:05:00,885 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:05:00,885 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:05:00,886 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-08 22:05:02,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5257b0b3/32f68442a41a44b2ad2bd34524e954a9/FLAG20a3eeaf6 [2025-03-08 22:05:02,269 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:05:02,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-08 22:05:02,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5257b0b3/32f68442a41a44b2ad2bd34524e954a9/FLAG20a3eeaf6 [2025-03-08 22:05:02,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5257b0b3/32f68442a41a44b2ad2bd34524e954a9 [2025-03-08 22:05:02,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:05:02,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:05:02,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:05:02,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:05:02,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:05:02,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfb277e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02, skipping insertion in model container [2025-03-08 22:05:02,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:05:02,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:05:02,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:05:02,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:05:02,551 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:05:02,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02 WrapperNode [2025-03-08 22:05:02,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:05:02,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:05:02,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:05:02,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:05:02,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,612 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 775 [2025-03-08 22:05:02,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:05:02,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:05:02,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:05:02,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:05:02,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,632 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:05:02,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:05:02,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:05:02,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:05:02,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (1/1) ... [2025-03-08 22:05:02,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:05:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:05:02,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:05:02,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:05:02,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:05:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:05:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:05:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:05:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:05:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:05:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:05:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:05:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:05:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:05:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:05:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:05:02,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:05:02,733 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:05:02,848 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:05:02,850 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:05:03,706 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:05:03,707 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:05:03,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:05:03,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:05:03,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:03 BoogieIcfgContainer [2025-03-08 22:05:03,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:05:03,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:05:03,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:05:03,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:05:03,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:05:02" (1/3) ... [2025-03-08 22:05:03,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd191f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:03, skipping insertion in model container [2025-03-08 22:05:03,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:05:02" (2/3) ... [2025-03-08 22:05:03,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd191f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:05:03, skipping insertion in model container [2025-03-08 22:05:03,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:05:03" (3/3) ... [2025-03-08 22:05:03,768 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-03-08 22:05:03,777 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:05:03,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 1001 locations, 1 initial locations, 6 loop locations, and 114 error locations. [2025-03-08 22:05:03,778 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:05:03,921 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:05:03,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1010 places, 1042 transitions, 2105 flow [2025-03-08 22:05:04,272 INFO L124 PetriNetUnfolderBase]: 42/1039 cut-off events. [2025-03-08 22:05:04,275 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:05:04,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1039 events. 42/1039 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2237 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-08 22:05:04,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 1010 places, 1042 transitions, 2105 flow [2025-03-08 22:05:04,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 988 places, 1018 transitions, 2054 flow [2025-03-08 22:05:04,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:05:04,317 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;@5992c345, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:05:04,318 INFO L334 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2025-03-08 22:05:04,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:05:04,337 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-08 22:05:04,337 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:05:04,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:04,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:04,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:04,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash -961876022, now seen corresponding path program 1 times [2025-03-08 22:05:04,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:04,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009021880] [2025-03-08 22:05:04,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:04,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:05:04,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:05:04,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:04,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:04,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:04,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009021880] [2025-03-08 22:05:04,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009021880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:04,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:04,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:04,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9694279] [2025-03-08 22:05:04,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:04,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:04,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:04,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:04,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-08 22:05:04,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1018 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:04,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:04,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-08 22:05:04,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:04,989 INFO L124 PetriNetUnfolderBase]: 54/1757 cut-off events. [2025-03-08 22:05:04,990 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 22:05:05,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1757 events. 54/1757 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8043 event pairs, 21 based on Foata normal form. 53/1509 useless extension candidates. Maximal degree in co-relation 1271. Up to 62 conditions per place. [2025-03-08 22:05:05,055 INFO L140 encePairwiseOnDemand]: 1017/1042 looper letters, 19 selfloop transitions, 2 changer transitions 16/995 dead transitions. [2025-03-08 22:05:05,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 995 transitions, 2050 flow [2025-03-08 22:05:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3029 transitions. [2025-03-08 22:05:05,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689699296225208 [2025-03-08 22:05:05,078 INFO L175 Difference]: Start difference. First operand has 988 places, 1018 transitions, 2054 flow. Second operand 3 states and 3029 transitions. [2025-03-08 22:05:05,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 995 transitions, 2050 flow [2025-03-08 22:05:05,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 995 transitions, 2038 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:05:05,101 INFO L231 Difference]: Finished difference. Result has 983 places, 979 transitions, 1968 flow [2025-03-08 22:05:05,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=983, PETRI_TRANSITIONS=979} [2025-03-08 22:05:05,107 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -5 predicate places. [2025-03-08 22:05:05,108 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 979 transitions, 1968 flow [2025-03-08 22:05:05,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:05,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:05,110 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] [2025-03-08 22:05:05,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:05:05,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:05,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1747389207, now seen corresponding path program 1 times [2025-03-08 22:05:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:05,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928794251] [2025-03-08 22:05:05,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:05,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 22:05:05,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 22:05:05,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:05,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:05,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928794251] [2025-03-08 22:05:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928794251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:05,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:05,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:05,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434331279] [2025-03-08 22:05:05,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:05,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:05,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:05,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-08 22:05:05,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 979 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:05,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:05,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-08 22:05:05,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:05,826 INFO L124 PetriNetUnfolderBase]: 114/2523 cut-off events. [2025-03-08 22:05:05,826 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:05:05,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 2523 events. 114/2523 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 15134 event pairs, 60 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 2647. Up to 146 conditions per place. [2025-03-08 22:05:05,866 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/969 dead transitions. [2025-03-08 22:05:05,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 969 transitions, 2002 flow [2025-03-08 22:05:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-08 22:05:05,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-08 22:05:05,872 INFO L175 Difference]: Start difference. First operand has 983 places, 979 transitions, 1968 flow. Second operand 3 states and 2980 transitions. [2025-03-08 22:05:05,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 969 transitions, 2002 flow [2025-03-08 22:05:05,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 969 transitions, 1998 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:05,888 INFO L231 Difference]: Finished difference. Result has 957 places, 969 transitions, 1946 flow [2025-03-08 22:05:05,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1946, PETRI_PLACES=957, PETRI_TRANSITIONS=969} [2025-03-08 22:05:05,890 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-03-08 22:05:05,890 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 969 transitions, 1946 flow [2025-03-08 22:05:05,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:05,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:05,892 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] [2025-03-08 22:05:05,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:05:05,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:05,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1873545488, now seen corresponding path program 1 times [2025-03-08 22:05:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024537651] [2025-03-08 22:05:05,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:05,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 22:05:05,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 22:05:05,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:05,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:05,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:05,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024537651] [2025-03-08 22:05:05,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024537651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:05,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:05,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:05,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716252396] [2025-03-08 22:05:05,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:05,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:05,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:05,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:05,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-08 22:05:06,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 969 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:06,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:06,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-08 22:05:06,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:06,537 INFO L124 PetriNetUnfolderBase]: 90/2666 cut-off events. [2025-03-08 22:05:06,537 INFO L125 PetriNetUnfolderBase]: For 5/9 co-relation queries the response was YES. [2025-03-08 22:05:06,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2666 events. 90/2666 cut-off events. For 5/9 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16495 event pairs, 39 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2738. Up to 89 conditions per place. [2025-03-08 22:05:06,577 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/968 dead transitions. [2025-03-08 22:05:06,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 968 transitions, 1986 flow [2025-03-08 22:05:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-03-08 22:05:06,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-03-08 22:05:06,583 INFO L175 Difference]: Start difference. First operand has 957 places, 969 transitions, 1946 flow. Second operand 3 states and 3007 transitions. [2025-03-08 22:05:06,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 968 transitions, 1986 flow [2025-03-08 22:05:06,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 968 transitions, 1985 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:06,596 INFO L231 Difference]: Finished difference. Result has 957 places, 968 transitions, 1947 flow [2025-03-08 22:05:06,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1947, PETRI_PLACES=957, PETRI_TRANSITIONS=968} [2025-03-08 22:05:06,598 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-03-08 22:05:06,598 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 968 transitions, 1947 flow [2025-03-08 22:05:06,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:06,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:06,600 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] [2025-03-08 22:05:06,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:05:06,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:06,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:06,601 INFO L85 PathProgramCache]: Analyzing trace with hash 999556984, now seen corresponding path program 1 times [2025-03-08 22:05:06,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:06,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700597929] [2025-03-08 22:05:06,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:06,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 22:05:06,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 22:05:06,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:06,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:06,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:06,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700597929] [2025-03-08 22:05:06,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700597929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:06,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591761701] [2025-03-08 22:05:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:06,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:06,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:06,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:06,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-08 22:05:06,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 968 transitions, 1947 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:06,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:06,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-08 22:05:06,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:07,555 INFO L124 PetriNetUnfolderBase]: 225/3970 cut-off events. [2025-03-08 22:05:07,556 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-08 22:05:07,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 3970 events. 225/3970 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 30208 event pairs, 132 based on Foata normal form. 0/3340 useless extension candidates. Maximal degree in co-relation 4256. Up to 264 conditions per place. [2025-03-08 22:05:07,632 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2025-03-08 22:05:07,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 958 transitions, 1981 flow [2025-03-08 22:05:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-08 22:05:07,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-08 22:05:07,637 INFO L175 Difference]: Start difference. First operand has 957 places, 968 transitions, 1947 flow. Second operand 3 states and 2980 transitions. [2025-03-08 22:05:07,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 958 transitions, 1981 flow [2025-03-08 22:05:07,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 958 transitions, 1977 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:07,648 INFO L231 Difference]: Finished difference. Result has 947 places, 958 transitions, 1925 flow [2025-03-08 22:05:07,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1925, PETRI_PLACES=947, PETRI_TRANSITIONS=958} [2025-03-08 22:05:07,650 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-03-08 22:05:07,651 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 958 transitions, 1925 flow [2025-03-08 22:05:07,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:07,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:07,653 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] [2025-03-08 22:05:07,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:05:07,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:07,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:07,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1484862372, now seen corresponding path program 1 times [2025-03-08 22:05:07,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463013526] [2025-03-08 22:05:07,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:07,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:07,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 22:05:07,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 22:05:07,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:07,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:07,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:07,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463013526] [2025-03-08 22:05:07,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463013526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:07,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:07,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:07,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644334002] [2025-03-08 22:05:07,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:07,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:07,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:07,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:07,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:07,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-03-08 22:05:07,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 958 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:07,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:07,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-03-08 22:05:07,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:08,043 INFO L124 PetriNetUnfolderBase]: 75/1833 cut-off events. [2025-03-08 22:05:08,044 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-03-08 22:05:08,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 1833 events. 75/1833 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8420 event pairs, 39 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 1891. Up to 89 conditions per place. [2025-03-08 22:05:08,071 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/957 dead transitions. [2025-03-08 22:05:08,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 957 transitions, 1965 flow [2025-03-08 22:05:08,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-03-08 22:05:08,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-03-08 22:05:08,076 INFO L175 Difference]: Start difference. First operand has 947 places, 958 transitions, 1925 flow. Second operand 3 states and 3007 transitions. [2025-03-08 22:05:08,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 957 transitions, 1965 flow [2025-03-08 22:05:08,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 957 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:08,086 INFO L231 Difference]: Finished difference. Result has 947 places, 957 transitions, 1926 flow [2025-03-08 22:05:08,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=947, PETRI_TRANSITIONS=957} [2025-03-08 22:05:08,088 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-03-08 22:05:08,088 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 957 transitions, 1926 flow [2025-03-08 22:05:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:08,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:08,090 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] [2025-03-08 22:05:08,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:05:08,090 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:08,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 176196081, now seen corresponding path program 1 times [2025-03-08 22:05:08,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:08,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966505115] [2025-03-08 22:05:08,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:08,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 22:05:08,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 22:05:08,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:08,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966505115] [2025-03-08 22:05:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966505115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618447962] [2025-03-08 22:05:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:08,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:08,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:08,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-03-08 22:05:08,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 957 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:08,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:08,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-03-08 22:05:08,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:08,759 INFO L124 PetriNetUnfolderBase]: 227/3703 cut-off events. [2025-03-08 22:05:08,759 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2025-03-08 22:05:08,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 3703 events. 227/3703 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 26904 event pairs, 132 based on Foata normal form. 0/3155 useless extension candidates. Maximal degree in co-relation 3952. Up to 274 conditions per place. [2025-03-08 22:05:08,808 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2025-03-08 22:05:08,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 947 transitions, 1960 flow [2025-03-08 22:05:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-03-08 22:05:08,813 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-03-08 22:05:08,813 INFO L175 Difference]: Start difference. First operand has 947 places, 957 transitions, 1926 flow. Second operand 3 states and 2980 transitions. [2025-03-08 22:05:08,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 947 transitions, 1960 flow [2025-03-08 22:05:08,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 947 transitions, 1956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:08,825 INFO L231 Difference]: Finished difference. Result has 937 places, 947 transitions, 1904 flow [2025-03-08 22:05:08,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=937, PETRI_TRANSITIONS=947} [2025-03-08 22:05:08,827 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-03-08 22:05:08,827 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 947 transitions, 1904 flow [2025-03-08 22:05:08,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:08,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:08,829 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-03-08 22:05:08,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:05:08,829 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:08,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1862522340, now seen corresponding path program 1 times [2025-03-08 22:05:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765418292] [2025-03-08 22:05:08,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:08,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 22:05:08,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 22:05:08,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:08,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:08,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:08,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765418292] [2025-03-08 22:05:08,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765418292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:08,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:08,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328802088] [2025-03-08 22:05:08,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:08,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:08,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:08,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:08,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-08 22:05:08,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 947 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:08,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:08,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-08 22:05:08,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:09,106 INFO L124 PetriNetUnfolderBase]: 26/1247 cut-off events. [2025-03-08 22:05:09,107 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:05:09,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1247 events. 26/1247 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3314 event pairs, 2 based on Foata normal form. 0/1094 useless extension candidates. Maximal degree in co-relation 1232. Up to 16 conditions per place. [2025-03-08 22:05:09,124 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-03-08 22:05:09,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 946 transitions, 1928 flow [2025-03-08 22:05:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-08 22:05:09,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-08 22:05:09,130 INFO L175 Difference]: Start difference. First operand has 937 places, 947 transitions, 1904 flow. Second operand 3 states and 3023 transitions. [2025-03-08 22:05:09,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 946 transitions, 1928 flow [2025-03-08 22:05:09,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 946 transitions, 1927 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:09,142 INFO L231 Difference]: Finished difference. Result has 937 places, 946 transitions, 1905 flow [2025-03-08 22:05:09,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=937, PETRI_TRANSITIONS=946} [2025-03-08 22:05:09,144 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-03-08 22:05:09,144 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 946 transitions, 1905 flow [2025-03-08 22:05:09,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:09,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:09,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:09,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:05:09,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:09,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash 152169937, now seen corresponding path program 1 times [2025-03-08 22:05:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103281582] [2025-03-08 22:05:09,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:09,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 22:05:09,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 22:05:09,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:09,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103281582] [2025-03-08 22:05:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103281582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393118311] [2025-03-08 22:05:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:09,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:09,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:09,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:09,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-08 22:05:09,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:09,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:09,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-08 22:05:09,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:09,570 INFO L124 PetriNetUnfolderBase]: 42/1848 cut-off events. [2025-03-08 22:05:09,570 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:09,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 1848 events. 42/1848 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8323 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1848. Up to 25 conditions per place. [2025-03-08 22:05:09,599 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2025-03-08 22:05:09,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 945 transitions, 1931 flow [2025-03-08 22:05:09,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:09,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-08 22:05:09,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-08 22:05:09,604 INFO L175 Difference]: Start difference. First operand has 937 places, 946 transitions, 1905 flow. Second operand 3 states and 3021 transitions. [2025-03-08 22:05:09,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 945 transitions, 1931 flow [2025-03-08 22:05:09,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:09,618 INFO L231 Difference]: Finished difference. Result has 936 places, 945 transitions, 1903 flow [2025-03-08 22:05:09,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=936, PETRI_TRANSITIONS=945} [2025-03-08 22:05:09,620 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -52 predicate places. [2025-03-08 22:05:09,620 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 945 transitions, 1903 flow [2025-03-08 22:05:09,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:09,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:09,621 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:09,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:05:09,621 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:09,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:09,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2116543638, now seen corresponding path program 1 times [2025-03-08 22:05:09,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:09,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469498748] [2025-03-08 22:05:09,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:09,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 22:05:09,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 22:05:09,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:09,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:09,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:09,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:09,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469498748] [2025-03-08 22:05:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469498748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:09,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:09,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:09,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775707466] [2025-03-08 22:05:09,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:09,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:09,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:09,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:09,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-08 22:05:09,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:09,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:09,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-08 22:05:09,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:10,046 INFO L124 PetriNetUnfolderBase]: 42/1847 cut-off events. [2025-03-08 22:05:10,046 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:10,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1847 events. 42/1847 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8294 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1847. Up to 25 conditions per place. [2025-03-08 22:05:10,075 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2025-03-08 22:05:10,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 944 transitions, 1929 flow [2025-03-08 22:05:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-08 22:05:10,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-08 22:05:10,079 INFO L175 Difference]: Start difference. First operand has 936 places, 945 transitions, 1903 flow. Second operand 3 states and 3021 transitions. [2025-03-08 22:05:10,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 944 transitions, 1929 flow [2025-03-08 22:05:10,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:10,089 INFO L231 Difference]: Finished difference. Result has 935 places, 944 transitions, 1901 flow [2025-03-08 22:05:10,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=935, PETRI_TRANSITIONS=944} [2025-03-08 22:05:10,091 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -53 predicate places. [2025-03-08 22:05:10,091 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 944 transitions, 1901 flow [2025-03-08 22:05:10,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:10,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:10,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:05:10,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:10,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1290096329, now seen corresponding path program 1 times [2025-03-08 22:05:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308459903] [2025-03-08 22:05:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:10,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:05:10,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:05:10,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:10,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:10,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308459903] [2025-03-08 22:05:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308459903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:10,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:10,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760217787] [2025-03-08 22:05:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:10,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:10,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:10,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:10,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:10,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-08 22:05:10,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:10,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-08 22:05:10,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:10,304 INFO L124 PetriNetUnfolderBase]: 23/1094 cut-off events. [2025-03-08 22:05:10,304 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:10,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1094 events. 23/1094 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2565 event pairs, 2 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1080. Up to 16 conditions per place. [2025-03-08 22:05:10,317 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2025-03-08 22:05:10,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 943 transitions, 1925 flow [2025-03-08 22:05:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-08 22:05:10,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-08 22:05:10,320 INFO L175 Difference]: Start difference. First operand has 935 places, 944 transitions, 1901 flow. Second operand 3 states and 3023 transitions. [2025-03-08 22:05:10,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 943 transitions, 1925 flow [2025-03-08 22:05:10,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 943 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:10,329 INFO L231 Difference]: Finished difference. Result has 934 places, 943 transitions, 1899 flow [2025-03-08 22:05:10,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=934, PETRI_TRANSITIONS=943} [2025-03-08 22:05:10,330 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -54 predicate places. [2025-03-08 22:05:10,330 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 943 transitions, 1899 flow [2025-03-08 22:05:10,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:10,332 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] [2025-03-08 22:05:10,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:05:10,332 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:10,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1040250114, now seen corresponding path program 1 times [2025-03-08 22:05:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:10,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045903031] [2025-03-08 22:05:10,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:10,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 22:05:10,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 22:05:10,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:10,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:10,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:10,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045903031] [2025-03-08 22:05:10,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045903031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:10,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:10,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:10,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516343900] [2025-03-08 22:05:10,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:10,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:10,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:10,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:10,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:10,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-08 22:05:10,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:10,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-08 22:05:10,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:10,582 INFO L124 PetriNetUnfolderBase]: 33/1395 cut-off events. [2025-03-08 22:05:10,582 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-08 22:05:10,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1395 events. 33/1395 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4871 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1392. Up to 25 conditions per place. [2025-03-08 22:05:10,604 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-03-08 22:05:10,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 942 transitions, 1925 flow [2025-03-08 22:05:10,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:10,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-08 22:05:10,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-08 22:05:10,609 INFO L175 Difference]: Start difference. First operand has 934 places, 943 transitions, 1899 flow. Second operand 3 states and 3021 transitions. [2025-03-08 22:05:10,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 942 transitions, 1925 flow [2025-03-08 22:05:10,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:10,619 INFO L231 Difference]: Finished difference. Result has 933 places, 942 transitions, 1897 flow [2025-03-08 22:05:10,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=933, PETRI_TRANSITIONS=942} [2025-03-08 22:05:10,621 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -55 predicate places. [2025-03-08 22:05:10,621 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 942 transitions, 1897 flow [2025-03-08 22:05:10,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:10,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:05:10,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:10,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:10,627 INFO L85 PathProgramCache]: Analyzing trace with hash 818013396, now seen corresponding path program 1 times [2025-03-08 22:05:10,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:10,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365130389] [2025-03-08 22:05:10,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:10,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:10,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:05:10,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:05:10,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:10,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:10,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:10,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365130389] [2025-03-08 22:05:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365130389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:10,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644122561] [2025-03-08 22:05:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:10,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:10,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:10,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:10,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-08 22:05:10,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:10,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-08 22:05:10,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:10,873 INFO L124 PetriNetUnfolderBase]: 33/1394 cut-off events. [2025-03-08 22:05:10,873 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-03-08 22:05:10,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1394 events. 33/1394 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4817 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1391. Up to 25 conditions per place. [2025-03-08 22:05:10,896 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2025-03-08 22:05:10,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 941 transitions, 1923 flow [2025-03-08 22:05:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-08 22:05:10,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-08 22:05:10,899 INFO L175 Difference]: Start difference. First operand has 933 places, 942 transitions, 1897 flow. Second operand 3 states and 3021 transitions. [2025-03-08 22:05:10,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 941 transitions, 1923 flow [2025-03-08 22:05:10,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 941 transitions, 1919 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:10,910 INFO L231 Difference]: Finished difference. Result has 932 places, 941 transitions, 1895 flow [2025-03-08 22:05:10,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=932, PETRI_TRANSITIONS=941} [2025-03-08 22:05:10,912 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -56 predicate places. [2025-03-08 22:05:10,912 INFO L471 AbstractCegarLoop]: Abstraction has has 932 places, 941 transitions, 1895 flow [2025-03-08 22:05:10,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:10,912 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] [2025-03-08 22:05:10,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:05:10,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:10,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash -58714966, now seen corresponding path program 1 times [2025-03-08 22:05:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792799062] [2025-03-08 22:05:10,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:10,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 22:05:10,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 22:05:10,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:10,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792799062] [2025-03-08 22:05:10,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792799062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:10,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:10,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:10,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467661489] [2025-03-08 22:05:10,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:10,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:10,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:10,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:10,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:10,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-03-08 22:05:10,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 941 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:10,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:10,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-03-08 22:05:10,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:11,078 INFO L124 PetriNetUnfolderBase]: 20/970 cut-off events. [2025-03-08 22:05:11,078 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-03-08 22:05:11,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 970 events. 20/970 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2071 event pairs, 2 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 955. Up to 16 conditions per place. [2025-03-08 22:05:11,091 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/940 dead transitions. [2025-03-08 22:05:11,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 940 transitions, 1919 flow [2025-03-08 22:05:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-03-08 22:05:11,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-03-08 22:05:11,095 INFO L175 Difference]: Start difference. First operand has 932 places, 941 transitions, 1895 flow. Second operand 3 states and 3023 transitions. [2025-03-08 22:05:11,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 940 transitions, 1919 flow [2025-03-08 22:05:11,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 940 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:11,106 INFO L231 Difference]: Finished difference. Result has 931 places, 940 transitions, 1893 flow [2025-03-08 22:05:11,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1893, PETRI_PLACES=931, PETRI_TRANSITIONS=940} [2025-03-08 22:05:11,109 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -57 predicate places. [2025-03-08 22:05:11,109 INFO L471 AbstractCegarLoop]: Abstraction has has 931 places, 940 transitions, 1893 flow [2025-03-08 22:05:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:11,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:11,110 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] [2025-03-08 22:05:11,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:05:11,111 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -192962854, now seen corresponding path program 1 times [2025-03-08 22:05:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524415027] [2025-03-08 22:05:11,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:11,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 22:05:11,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 22:05:11,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:11,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524415027] [2025-03-08 22:05:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524415027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896093561] [2025-03-08 22:05:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:11,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:11,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:11,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:11,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-08 22:05:11,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 940 transitions, 1893 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:11,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:11,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-08 22:05:11,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:11,337 INFO L124 PetriNetUnfolderBase]: 30/1205 cut-off events. [2025-03-08 22:05:11,337 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-08 22:05:11,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1205 events. 30/1205 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3075 event pairs, 6 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1199. Up to 25 conditions per place. [2025-03-08 22:05:11,347 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/939 dead transitions. [2025-03-08 22:05:11,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 939 transitions, 1919 flow [2025-03-08 22:05:11,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-08 22:05:11,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-08 22:05:11,351 INFO L175 Difference]: Start difference. First operand has 931 places, 940 transitions, 1893 flow. Second operand 3 states and 3021 transitions. [2025-03-08 22:05:11,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 939 transitions, 1919 flow [2025-03-08 22:05:11,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 939 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:11,360 INFO L231 Difference]: Finished difference. Result has 930 places, 939 transitions, 1891 flow [2025-03-08 22:05:11,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=930, PETRI_TRANSITIONS=939} [2025-03-08 22:05:11,361 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -58 predicate places. [2025-03-08 22:05:11,361 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 939 transitions, 1891 flow [2025-03-08 22:05:11,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:11,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:11,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:11,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:05:11,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:11,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:11,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1323011254, now seen corresponding path program 1 times [2025-03-08 22:05:11,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:11,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574213273] [2025-03-08 22:05:11,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:11,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 22:05:11,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 22:05:11,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:11,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:11,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:11,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574213273] [2025-03-08 22:05:11,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574213273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:11,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:11,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:11,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890926958] [2025-03-08 22:05:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:11,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:11,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:11,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:11,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-03-08 22:05:11,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 939 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:11,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:11,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-03-08 22:05:11,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:11,566 INFO L124 PetriNetUnfolderBase]: 30/1166 cut-off events. [2025-03-08 22:05:11,566 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-03-08 22:05:11,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1166 events. 30/1166 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2951 event pairs, 6 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1160. Up to 25 conditions per place. [2025-03-08 22:05:11,581 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/938 dead transitions. [2025-03-08 22:05:11,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 938 transitions, 1917 flow [2025-03-08 22:05:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-03-08 22:05:11,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-03-08 22:05:11,585 INFO L175 Difference]: Start difference. First operand has 930 places, 939 transitions, 1891 flow. Second operand 3 states and 3021 transitions. [2025-03-08 22:05:11,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 938 transitions, 1917 flow [2025-03-08 22:05:11,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 938 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:11,597 INFO L231 Difference]: Finished difference. Result has 929 places, 938 transitions, 1889 flow [2025-03-08 22:05:11,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1889, PETRI_PLACES=929, PETRI_TRANSITIONS=938} [2025-03-08 22:05:11,599 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -59 predicate places. [2025-03-08 22:05:11,599 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 938 transitions, 1889 flow [2025-03-08 22:05:11,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:11,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:11,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:11,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:05:11,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash 561863228, now seen corresponding path program 1 times [2025-03-08 22:05:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:11,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157182051] [2025-03-08 22:05:11,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:11,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 22:05:11,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 22:05:11,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:11,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:11,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:11,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157182051] [2025-03-08 22:05:11,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157182051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:11,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:11,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:11,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440104726] [2025-03-08 22:05:11,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:11,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:11,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:11,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:11,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-08 22:05:11,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 938 transitions, 1889 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:11,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:11,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-08 22:05:11,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:11,874 INFO L124 PetriNetUnfolderBase]: 42/1529 cut-off events. [2025-03-08 22:05:11,875 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:05:11,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 1529 events. 42/1529 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6379 event pairs, 12 based on Foata normal form. 0/1336 useless extension candidates. Maximal degree in co-relation 1540. Up to 38 conditions per place. [2025-03-08 22:05:11,898 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2025-03-08 22:05:11,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 937 transitions, 1917 flow [2025-03-08 22:05:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-08 22:05:11,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-08 22:05:11,902 INFO L175 Difference]: Start difference. First operand has 929 places, 938 transitions, 1889 flow. Second operand 3 states and 3019 transitions. [2025-03-08 22:05:11,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 937 transitions, 1917 flow [2025-03-08 22:05:11,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:11,916 INFO L231 Difference]: Finished difference. Result has 928 places, 937 transitions, 1887 flow [2025-03-08 22:05:11,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=928, PETRI_TRANSITIONS=937} [2025-03-08 22:05:11,917 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2025-03-08 22:05:11,917 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 937 transitions, 1887 flow [2025-03-08 22:05:11,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:11,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:11,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:05:11,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1880845007, now seen corresponding path program 1 times [2025-03-08 22:05:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502168426] [2025-03-08 22:05:11,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:11,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 22:05:11,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 22:05:11,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:11,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:12,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502168426] [2025-03-08 22:05:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502168426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:12,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:12,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118588925] [2025-03-08 22:05:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:12,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:12,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:12,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:12,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-03-08 22:05:12,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 937 transitions, 1887 flow. Second operand has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:12,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:12,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-03-08 22:05:12,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:26,452 INFO L124 PetriNetUnfolderBase]: 15257/85351 cut-off events. [2025-03-08 22:05:26,453 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-03-08 22:05:26,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107780 conditions, 85351 events. 15257/85351 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 1264358 event pairs, 14040 based on Foata normal form. 0/74614 useless extension candidates. Maximal degree in co-relation 107738. Up to 22026 conditions per place. [2025-03-08 22:05:26,978 INFO L140 encePairwiseOnDemand]: 1024/1042 looper letters, 87 selfloop transitions, 15 changer transitions 0/934 dead transitions. [2025-03-08 22:05:26,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 934 transitions, 2085 flow [2025-03-08 22:05:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5583 transitions. [2025-03-08 22:05:26,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8929942418426103 [2025-03-08 22:05:26,984 INFO L175 Difference]: Start difference. First operand has 928 places, 937 transitions, 1887 flow. Second operand 6 states and 5583 transitions. [2025-03-08 22:05:26,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 934 transitions, 2085 flow [2025-03-08 22:05:26,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 934 transitions, 2081 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:26,992 INFO L231 Difference]: Finished difference. Result has 928 places, 934 transitions, 1907 flow [2025-03-08 22:05:26,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=919, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=928, PETRI_TRANSITIONS=934} [2025-03-08 22:05:26,993 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -60 predicate places. [2025-03-08 22:05:26,993 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 934 transitions, 1907 flow [2025-03-08 22:05:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:26,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:26,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:26,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:05:26,994 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:26,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 325120538, now seen corresponding path program 1 times [2025-03-08 22:05:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:26,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664302699] [2025-03-08 22:05:26,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:27,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 22:05:27,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 22:05:27,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:27,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:27,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:27,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:27,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664302699] [2025-03-08 22:05:27,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664302699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:27,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:27,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:27,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752792846] [2025-03-08 22:05:27,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:27,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:27,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:27,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:27,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:27,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-08 22:05:27,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 934 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:27,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:27,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-08 22:05:27,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:27,328 INFO L124 PetriNetUnfolderBase]: 62/2127 cut-off events. [2025-03-08 22:05:27,329 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-03-08 22:05:27,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 2127 events. 62/2127 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10841 event pairs, 20 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2169. Up to 50 conditions per place. [2025-03-08 22:05:27,360 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/933 dead transitions. [2025-03-08 22:05:27,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 929 places, 933 transitions, 1935 flow [2025-03-08 22:05:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-08 22:05:27,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-08 22:05:27,363 INFO L175 Difference]: Start difference. First operand has 928 places, 934 transitions, 1907 flow. Second operand 3 states and 3019 transitions. [2025-03-08 22:05:27,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 929 places, 933 transitions, 1935 flow [2025-03-08 22:05:27,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 933 transitions, 1905 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:27,372 INFO L231 Difference]: Finished difference. Result has 924 places, 933 transitions, 1879 flow [2025-03-08 22:05:27,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=924, PETRI_TRANSITIONS=933} [2025-03-08 22:05:27,373 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -64 predicate places. [2025-03-08 22:05:27,373 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 933 transitions, 1879 flow [2025-03-08 22:05:27,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:27,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:27,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:27,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:05:27,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:27,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:27,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1865059174, now seen corresponding path program 1 times [2025-03-08 22:05:27,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:27,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020158695] [2025-03-08 22:05:27,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:27,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:27,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 22:05:27,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 22:05:27,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:27,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:27,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:27,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020158695] [2025-03-08 22:05:27,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020158695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:27,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:27,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:27,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016283601] [2025-03-08 22:05:27,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:27,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:27,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:27,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:27,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:27,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-03-08 22:05:27,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 933 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:27,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:27,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-03-08 22:05:27,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:27,669 INFO L124 PetriNetUnfolderBase]: 53/1627 cut-off events. [2025-03-08 22:05:27,669 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-03-08 22:05:27,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1627 events. 53/1627 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6135 event pairs, 20 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1648. Up to 50 conditions per place. [2025-03-08 22:05:27,696 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2025-03-08 22:05:27,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 932 transitions, 1907 flow [2025-03-08 22:05:27,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-03-08 22:05:27,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-03-08 22:05:27,701 INFO L175 Difference]: Start difference. First operand has 924 places, 933 transitions, 1879 flow. Second operand 3 states and 3019 transitions. [2025-03-08 22:05:27,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 932 transitions, 1907 flow [2025-03-08 22:05:27,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 932 transitions, 1903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:27,712 INFO L231 Difference]: Finished difference. Result has 923 places, 932 transitions, 1877 flow [2025-03-08 22:05:27,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1877, PETRI_PLACES=923, PETRI_TRANSITIONS=932} [2025-03-08 22:05:27,715 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -65 predicate places. [2025-03-08 22:05:27,715 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 932 transitions, 1877 flow [2025-03-08 22:05:27,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:27,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:27,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:27,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:05:27,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err24ASSERT_VIOLATIONDATA_RACE, thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-03-08 22:05:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1637194302, now seen corresponding path program 1 times [2025-03-08 22:05:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:27,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026440663] [2025-03-08 22:05:27,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:27,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-08 22:05:27,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-08 22:05:27,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:27,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:27,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:27,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026440663] [2025-03-08 22:05:27,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026440663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:27,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:27,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:27,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43947636] [2025-03-08 22:05:27,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:27,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:27,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:27,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:27,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:28,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-03-08 22:05:28,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 915.0) internal successors, (2745), 3 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:05:28,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:28,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-03-08 22:05:28,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand