./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-time-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-time-subst.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 55dce27fdc9c44ff408174badf0a943270d2adadc96357bb37463f058a6a7cee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:53:38,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:53:38,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:53:38,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:53:38,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:53:38,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:53:38,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:53:38,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:53:38,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:53:38,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:53:38,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:53:38,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:53:38,853 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:53:38,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:53:38,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:53:38,853 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:53:38,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:53:38,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:53:38,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:53:38,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:53:38,856 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:53:38,856 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 -> 55dce27fdc9c44ff408174badf0a943270d2adadc96357bb37463f058a6a7cee [2025-03-04 06:53:39,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:53:39,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:53:39,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:53:39,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:53:39,106 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:53:39,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-subst.wvr.c [2025-03-04 06:53:40,286 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e385162/aeeb8fa434034234964a97e099c6de0c/FLAGe625777f2 [2025-03-04 06:53:40,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:53:40,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-subst.wvr.c [2025-03-04 06:53:40,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e385162/aeeb8fa434034234964a97e099c6de0c/FLAGe625777f2 [2025-03-04 06:53:40,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e385162/aeeb8fa434034234964a97e099c6de0c [2025-03-04 06:53:40,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:53:40,868 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:53:40,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:53:40,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:53:40,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:53:40,875 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:53:40" (1/1) ... [2025-03-04 06:53:40,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fce6171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:40, skipping insertion in model container [2025-03-04 06:53:40,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:53:40" (1/1) ... [2025-03-04 06:53:40,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:53:41,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:53:41,042 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:53:41,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:53:41,068 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:53:41,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41 WrapperNode [2025-03-04 06:53:41,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:53:41,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:53:41,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:53:41,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:53:41,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,098 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 323 [2025-03-04 06:53:41,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:53:41,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:53:41,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:53:41,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:53:41,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,111 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:53:41,117 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:53:41,117 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:53:41,117 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:53:41,118 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (1/1) ... [2025-03-04 06:53:41,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:53:41,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:53:41,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:53:41,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:53:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:53:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:53:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:53:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:53:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:53:41,167 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:53:41,243 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:53:41,244 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:53:41,591 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:53:41,591 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:53:41,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:53:41,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:53:41,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:41 BoogieIcfgContainer [2025-03-04 06:53:41,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:53:41,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:53:41,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:53:41,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:53:41,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:53:40" (1/3) ... [2025-03-04 06:53:41,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18be3c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:53:41, skipping insertion in model container [2025-03-04 06:53:41,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:53:41" (2/3) ... [2025-03-04 06:53:41,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18be3c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:53:41, skipping insertion in model container [2025-03-04 06:53:41,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:41" (3/3) ... [2025-03-04 06:53:41,844 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-subst.wvr.c [2025-03-04 06:53:41,855 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:53:41,856 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-subst.wvr.c that has 4 procedures, 200 locations, 1 initial locations, 0 loop locations, and 38 error locations. [2025-03-04 06:53:41,856 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:53:41,914 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:53:41,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 202 transitions, 425 flow [2025-03-04 06:53:41,991 INFO L124 PetriNetUnfolderBase]: 3/199 cut-off events. [2025-03-04 06:53:41,992 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:53:41,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 199 events. 3/199 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-04 06:53:41,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 202 transitions, 425 flow [2025-03-04 06:53:41,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 176 transitions, 370 flow [2025-03-04 06:53:42,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:53:42,013 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;@148d5d9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:53:42,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-04 06:53:42,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:53:42,022 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-04 06:53:42,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:53:42,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:42,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:42,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,028 INFO L85 PathProgramCache]: Analyzing trace with hash 928996549, now seen corresponding path program 1 times [2025-03-04 06:53:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798034065] [2025-03-04 06:53:42,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 06:53:42,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 06:53:42,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:42,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798034065] [2025-03-04 06:53:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798034065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273668462] [2025-03-04 06:53:42,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:42,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:42,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:42,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:42,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:42,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:42,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 176 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:42,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:42,287 INFO L124 PetriNetUnfolderBase]: 15/198 cut-off events. [2025-03-04 06:53:42,288 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 06:53:42,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 198 events. 15/198 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 222 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 150. Up to 40 conditions per place. [2025-03-04 06:53:42,290 INFO L140 encePairwiseOnDemand]: 175/202 looper letters, 12 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-03-04 06:53:42,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 151 transitions, 348 flow [2025-03-04 06:53:42,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:42,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2025-03-04 06:53:42,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8564356435643564 [2025-03-04 06:53:42,301 INFO L175 Difference]: Start difference. First operand has 186 places, 176 transitions, 370 flow. Second operand 3 states and 519 transitions. [2025-03-04 06:53:42,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 151 transitions, 348 flow [2025-03-04 06:53:42,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 151 transitions, 336 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:53:42,308 INFO L231 Difference]: Finished difference. Result has 157 places, 151 transitions, 312 flow [2025-03-04 06:53:42,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=157, PETRI_TRANSITIONS=151} [2025-03-04 06:53:42,312 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -29 predicate places. [2025-03-04 06:53:42,313 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 312 flow [2025-03-04 06:53:42,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:42,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:53:42,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:42,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash 897820596, now seen corresponding path program 1 times [2025-03-04 06:53:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351184538] [2025-03-04 06:53:42,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:53:42,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:53:42,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:42,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:42,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351184538] [2025-03-04 06:53:42,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351184538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:42,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:42,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516824280] [2025-03-04 06:53:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:42,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:42,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:42,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:42,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:42,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:42,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 151 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:42,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:42,451 INFO L124 PetriNetUnfolderBase]: 15/197 cut-off events. [2025-03-04 06:53:42,452 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:42,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 197 events. 15/197 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 222 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 216. Up to 40 conditions per place. [2025-03-04 06:53:42,454 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 0/150 dead transitions. [2025-03-04 06:53:42,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 150 transitions, 338 flow [2025-03-04 06:53:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-04 06:53:42,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-04 06:53:42,457 INFO L175 Difference]: Start difference. First operand has 157 places, 151 transitions, 312 flow. Second operand 3 states and 495 transitions. [2025-03-04 06:53:42,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 150 transitions, 338 flow [2025-03-04 06:53:42,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 150 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:42,461 INFO L231 Difference]: Finished difference. Result has 156 places, 150 transitions, 310 flow [2025-03-04 06:53:42,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=156, PETRI_TRANSITIONS=150} [2025-03-04 06:53:42,462 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -30 predicate places. [2025-03-04 06:53:42,462 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 150 transitions, 310 flow [2025-03-04 06:53:42,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:42,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:53:42,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:42,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2090804022, now seen corresponding path program 1 times [2025-03-04 06:53:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772472311] [2025-03-04 06:53:42,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 06:53:42,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 06:53:42,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:42,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772472311] [2025-03-04 06:53:42,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772472311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:42,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:42,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:42,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479096716] [2025-03-04 06:53:42,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:42,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:42,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:42,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:42,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:42,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 150 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:42,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:42,563 INFO L124 PetriNetUnfolderBase]: 15/196 cut-off events. [2025-03-04 06:53:42,563 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:42,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 196 events. 15/196 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 220 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 207. Up to 40 conditions per place. [2025-03-04 06:53:42,565 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2025-03-04 06:53:42,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 149 transitions, 336 flow [2025-03-04 06:53:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:42,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-04 06:53:42,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-04 06:53:42,568 INFO L175 Difference]: Start difference. First operand has 156 places, 150 transitions, 310 flow. Second operand 3 states and 495 transitions. [2025-03-04 06:53:42,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 149 transitions, 336 flow [2025-03-04 06:53:42,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:42,570 INFO L231 Difference]: Finished difference. Result has 155 places, 149 transitions, 308 flow [2025-03-04 06:53:42,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=155, PETRI_TRANSITIONS=149} [2025-03-04 06:53:42,571 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -31 predicate places. [2025-03-04 06:53:42,571 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 149 transitions, 308 flow [2025-03-04 06:53:42,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:53:42,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1793861074, now seen corresponding path program 1 times [2025-03-04 06:53:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416381392] [2025-03-04 06:53:42,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 06:53:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 06:53:42,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:42,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:42,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416381392] [2025-03-04 06:53:42,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416381392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:42,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:42,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:42,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416764850] [2025-03-04 06:53:42,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:42,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:42,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:42,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:42,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:42,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:42,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 149 transitions, 308 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:42,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:42,671 INFO L124 PetriNetUnfolderBase]: 15/195 cut-off events. [2025-03-04 06:53:42,671 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:42,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 195 events. 15/195 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 198. Up to 40 conditions per place. [2025-03-04 06:53:42,672 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2025-03-04 06:53:42,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 148 transitions, 334 flow [2025-03-04 06:53:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:42,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-04 06:53:42,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-04 06:53:42,674 INFO L175 Difference]: Start difference. First operand has 155 places, 149 transitions, 308 flow. Second operand 3 states and 495 transitions. [2025-03-04 06:53:42,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 148 transitions, 334 flow [2025-03-04 06:53:42,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 148 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:42,676 INFO L231 Difference]: Finished difference. Result has 154 places, 148 transitions, 306 flow [2025-03-04 06:53:42,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=154, PETRI_TRANSITIONS=148} [2025-03-04 06:53:42,677 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -32 predicate places. [2025-03-04 06:53:42,677 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 148 transitions, 306 flow [2025-03-04 06:53:42,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:53:42,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1729817744, now seen corresponding path program 1 times [2025-03-04 06:53:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526477968] [2025-03-04 06:53:42,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:53:42,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:53:42,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:42,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526477968] [2025-03-04 06:53:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526477968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:42,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988937009] [2025-03-04 06:53:42,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:42,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:42,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:42,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:42,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:42,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 148 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:42,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:42,783 INFO L124 PetriNetUnfolderBase]: 15/194 cut-off events. [2025-03-04 06:53:42,783 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:42,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 194 events. 15/194 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 216 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 189. Up to 40 conditions per place. [2025-03-04 06:53:42,784 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 0/147 dead transitions. [2025-03-04 06:53:42,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 332 flow [2025-03-04 06:53:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-04 06:53:42,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-04 06:53:42,787 INFO L175 Difference]: Start difference. First operand has 154 places, 148 transitions, 306 flow. Second operand 3 states and 495 transitions. [2025-03-04 06:53:42,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 332 flow [2025-03-04 06:53:42,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 147 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:42,789 INFO L231 Difference]: Finished difference. Result has 153 places, 147 transitions, 304 flow [2025-03-04 06:53:42,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=304, PETRI_PLACES=153, PETRI_TRANSITIONS=147} [2025-03-04 06:53:42,790 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -33 predicate places. [2025-03-04 06:53:42,790 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 147 transitions, 304 flow [2025-03-04 06:53:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:42,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:53:42,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:42,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1072478074, now seen corresponding path program 1 times [2025-03-04 06:53:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376211340] [2025-03-04 06:53:42,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 06:53:42,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 06:53:42,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:42,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376211340] [2025-03-04 06:53:42,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376211340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:42,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:42,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044491248] [2025-03-04 06:53:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:42,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:42,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:42,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:42,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:42,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 147 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:42,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:42,922 INFO L124 PetriNetUnfolderBase]: 15/193 cut-off events. [2025-03-04 06:53:42,923 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:42,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 193 events. 15/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 180. Up to 40 conditions per place. [2025-03-04 06:53:42,924 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-03-04 06:53:42,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 146 transitions, 330 flow [2025-03-04 06:53:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-04 06:53:42,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-04 06:53:42,926 INFO L175 Difference]: Start difference. First operand has 153 places, 147 transitions, 304 flow. Second operand 3 states and 495 transitions. [2025-03-04 06:53:42,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 146 transitions, 330 flow [2025-03-04 06:53:42,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 146 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:42,928 INFO L231 Difference]: Finished difference. Result has 152 places, 146 transitions, 302 flow [2025-03-04 06:53:42,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=152, PETRI_TRANSITIONS=146} [2025-03-04 06:53:42,929 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -34 predicate places. [2025-03-04 06:53:42,930 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 146 transitions, 302 flow [2025-03-04 06:53:42,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:42,931 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] [2025-03-04 06:53:42,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:53:42,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:42,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 145564466, now seen corresponding path program 1 times [2025-03-04 06:53:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:42,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766651741] [2025-03-04 06:53:42,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:42,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 06:53:42,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 06:53:42,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:42,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:42,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:42,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766651741] [2025-03-04 06:53:42,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766651741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:42,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:42,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065389553] [2025-03-04 06:53:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:42,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:42,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:42,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:42,989 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 202 [2025-03-04 06:53:42,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 146 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:42,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:42,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 202 [2025-03-04 06:53:42,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:43,022 INFO L124 PetriNetUnfolderBase]: 15/192 cut-off events. [2025-03-04 06:53:43,023 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:43,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 192 events. 15/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 211 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 172. Up to 41 conditions per place. [2025-03-04 06:53:43,023 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 13 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2025-03-04 06:53:43,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 145 transitions, 330 flow [2025-03-04 06:53:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2025-03-04 06:53:43,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8135313531353136 [2025-03-04 06:53:43,025 INFO L175 Difference]: Start difference. First operand has 152 places, 146 transitions, 302 flow. Second operand 3 states and 493 transitions. [2025-03-04 06:53:43,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 145 transitions, 330 flow [2025-03-04 06:53:43,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:43,027 INFO L231 Difference]: Finished difference. Result has 151 places, 145 transitions, 300 flow [2025-03-04 06:53:43,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=151, PETRI_TRANSITIONS=145} [2025-03-04 06:53:43,027 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -35 predicate places. [2025-03-04 06:53:43,028 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 145 transitions, 300 flow [2025-03-04 06:53:43,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:43,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:43,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:53:43,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1615061587, now seen corresponding path program 1 times [2025-03-04 06:53:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077883771] [2025-03-04 06:53:43,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:43,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:43,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:53:43,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:53:43,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:43,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077883771] [2025-03-04 06:53:43,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077883771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:43,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147165787] [2025-03-04 06:53:43,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:43,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:43,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:43,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:43,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 202 [2025-03-04 06:53:43,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 145 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:43,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 202 [2025-03-04 06:53:43,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:43,116 INFO L124 PetriNetUnfolderBase]: 15/191 cut-off events. [2025-03-04 06:53:43,116 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:43,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 191 events. 15/191 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 209 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 164. Up to 42 conditions per place. [2025-03-04 06:53:43,118 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 14 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-04 06:53:43,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 330 flow [2025-03-04 06:53:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2025-03-04 06:53:43,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102310231023102 [2025-03-04 06:53:43,119 INFO L175 Difference]: Start difference. First operand has 151 places, 145 transitions, 300 flow. Second operand 3 states and 491 transitions. [2025-03-04 06:53:43,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 330 flow [2025-03-04 06:53:43,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 144 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:43,122 INFO L231 Difference]: Finished difference. Result has 150 places, 144 transitions, 298 flow [2025-03-04 06:53:43,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=150, PETRI_TRANSITIONS=144} [2025-03-04 06:53:43,122 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -36 predicate places. [2025-03-04 06:53:43,123 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 144 transitions, 298 flow [2025-03-04 06:53:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:43,123 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] [2025-03-04 06:53:43,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:53:43,124 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1157475617, now seen corresponding path program 1 times [2025-03-04 06:53:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694163190] [2025-03-04 06:53:43,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:43,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 06:53:43,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 06:53:43,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:43,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:43,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694163190] [2025-03-04 06:53:43,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694163190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:43,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740294194] [2025-03-04 06:53:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:43,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:43,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:43,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:43,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 202 [2025-03-04 06:53:43,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 144 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:43,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 202 [2025-03-04 06:53:43,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:43,232 INFO L124 PetriNetUnfolderBase]: 15/190 cut-off events. [2025-03-04 06:53:43,232 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:43,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 190 events. 15/190 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 206 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 155. Up to 42 conditions per place. [2025-03-04 06:53:43,233 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 14 selfloop transitions, 2 changer transitions 0/143 dead transitions. [2025-03-04 06:53:43,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 143 transitions, 328 flow [2025-03-04 06:53:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2025-03-04 06:53:43,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102310231023102 [2025-03-04 06:53:43,236 INFO L175 Difference]: Start difference. First operand has 150 places, 144 transitions, 298 flow. Second operand 3 states and 491 transitions. [2025-03-04 06:53:43,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 143 transitions, 328 flow [2025-03-04 06:53:43,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 143 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:43,245 INFO L231 Difference]: Finished difference. Result has 149 places, 143 transitions, 296 flow [2025-03-04 06:53:43,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2025-03-04 06:53:43,246 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -37 predicate places. [2025-03-04 06:53:43,246 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 296 flow [2025-03-04 06:53:43,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:43,247 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] [2025-03-04 06:53:43,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:53:43,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1114211784, now seen corresponding path program 1 times [2025-03-04 06:53:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213322172] [2025-03-04 06:53:43,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:43,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 06:53:43,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 06:53:43,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:43,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:43,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-04 06:53:43,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:43,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213322172] [2025-03-04 06:53:43,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213322172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:43,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:43,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277005924] [2025-03-04 06:53:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:43,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:43,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:43,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:43,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:43,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 202 [2025-03-04 06:53:43,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:43,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 202 [2025-03-04 06:53:43,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:43,417 INFO L124 PetriNetUnfolderBase]: 15/189 cut-off events. [2025-03-04 06:53:43,418 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:43,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 189 events. 15/189 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 204 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 142. Up to 38 conditions per place. [2025-03-04 06:53:43,419 INFO L140 encePairwiseOnDemand]: 200/202 looper letters, 11 selfloop transitions, 1 changer transitions 0/142 dead transitions. [2025-03-04 06:53:43,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 142 transitions, 318 flow [2025-03-04 06:53:43,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2025-03-04 06:53:43,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283828382838284 [2025-03-04 06:53:43,424 INFO L175 Difference]: Start difference. First operand has 149 places, 143 transitions, 296 flow. Second operand 3 states and 502 transitions. [2025-03-04 06:53:43,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 142 transitions, 318 flow [2025-03-04 06:53:43,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 142 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:53:43,426 INFO L231 Difference]: Finished difference. Result has 148 places, 142 transitions, 292 flow [2025-03-04 06:53:43,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=148, PETRI_TRANSITIONS=142} [2025-03-04 06:53:43,430 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -38 predicate places. [2025-03-04 06:53:43,430 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 142 transitions, 292 flow [2025-03-04 06:53:43,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:43,431 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-04 06:53:43,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:53:43,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:43,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1099841540, now seen corresponding path program 1 times [2025-03-04 06:53:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292700442] [2025-03-04 06:53:43,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:43,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 06:53:43,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 06:53:43,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:43,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292700442] [2025-03-04 06:53:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292700442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:43,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:43,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240750649] [2025-03-04 06:53:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:43,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:43,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:43,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:43,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:43,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:43,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 142 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:43,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:43,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:43,566 INFO L124 PetriNetUnfolderBase]: 15/187 cut-off events. [2025-03-04 06:53:43,566 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:43,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 187 events. 15/187 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 201 event pairs, 15 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 216. Up to 38 conditions per place. [2025-03-04 06:53:43,567 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 13 selfloop transitions, 1 changer transitions 0/140 dead transitions. [2025-03-04 06:53:43,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 140 transitions, 316 flow [2025-03-04 06:53:43,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:43,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-04 06:53:43,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8184818481848185 [2025-03-04 06:53:43,569 INFO L175 Difference]: Start difference. First operand has 148 places, 142 transitions, 292 flow. Second operand 3 states and 496 transitions. [2025-03-04 06:53:43,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 140 transitions, 316 flow [2025-03-04 06:53:43,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 140 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:43,570 INFO L231 Difference]: Finished difference. Result has 147 places, 140 transitions, 289 flow [2025-03-04 06:53:43,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=147, PETRI_TRANSITIONS=140} [2025-03-04 06:53:43,571 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -39 predicate places. [2025-03-04 06:53:43,571 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 140 transitions, 289 flow [2025-03-04 06:53:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:53:43,572 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] [2025-03-04 06:53:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:53:43,572 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-04 06:53:43,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:53:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -385738990, now seen corresponding path program 1 times [2025-03-04 06:53:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:53:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087955378] [2025-03-04 06:53:43,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:53:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:53:43,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 06:53:43,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 06:53:43,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:53:43,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:53:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:53:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:53:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087955378] [2025-03-04 06:53:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087955378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:53:43,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:53:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:53:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842166344] [2025-03-04 06:53:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:53:43,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:53:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:53:43,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:53:43,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:53:43,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-04 06:53:43,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 140 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:53:43,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-04 06:53:43,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:53:43,698 INFO L124 PetriNetUnfolderBase]: 15/185 cut-off events. [2025-03-04 06:53:43,698 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:53:43,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 185 events. 15/185 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 199 event pairs, 15 based on Foata normal form. 1/182 useless extension candidates. Maximal degree in co-relation 221. Up to 38 conditions per place. [2025-03-04 06:53:43,699 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 0 selfloop transitions, 0 changer transitions 138/138 dead transitions. [2025-03-04 06:53:43,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 138 transitions, 311 flow [2025-03-04 06:53:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:53:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:53:43,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-04 06:53:43,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-04 06:53:43,702 INFO L175 Difference]: Start difference. First operand has 147 places, 140 transitions, 289 flow. Second operand 3 states and 495 transitions. [2025-03-04 06:53:43,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 138 transitions, 311 flow [2025-03-04 06:53:43,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 138 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:53:43,703 INFO L231 Difference]: Finished difference. Result has 146 places, 0 transitions, 0 flow [2025-03-04 06:53:43,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=146, PETRI_TRANSITIONS=0} [2025-03-04 06:53:43,704 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -40 predicate places. [2025-03-04 06:53:43,704 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 0 transitions, 0 flow [2025-03-04 06:53:43,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (64 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (62 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (61 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (60 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (59 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (56 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (55 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (54 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (52 of 65 remaining) [2025-03-04 06:53:43,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (50 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (49 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (48 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (47 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (46 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (45 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (44 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (41 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (39 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (36 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 65 remaining) [2025-03-04 06:53:43,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 65 remaining) [2025-03-04 06:53:43,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 65 remaining) [2025-03-04 06:53:43,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 65 remaining) [2025-03-04 06:53:43,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 65 remaining) [2025-03-04 06:53:43,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 65 remaining) [2025-03-04 06:53:43,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 65 remaining) [2025-03-04 06:53:43,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (16 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (13 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 65 remaining) [2025-03-04 06:53:43,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 65 remaining) [2025-03-04 06:53:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 65 remaining) [2025-03-04 06:53:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 65 remaining) [2025-03-04 06:53:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 65 remaining) [2025-03-04 06:53:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 65 remaining) [2025-03-04 06:53:43,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 65 remaining) [2025-03-04 06:53:43,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:53:43,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:53:43,714 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:53:43,714 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:53:43,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:53:43 BasicIcfg [2025-03-04 06:53:43,718 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:53:43,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:53:43,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:53:43,719 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:53:43,719 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:53:41" (3/4) ... [2025-03-04 06:53:43,720 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:53:43,722 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:53:43,722 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:53:43,722 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:53:43,725 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 06:53:43,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:53:43,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:53:43,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:53:43,785 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:53:43,785 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:53:43,785 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:53:43,785 INFO L158 Benchmark]: Toolchain (without parser) took 2917.40ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 128.8MB in the beginning and 142.1MB in the end (delta: -13.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2025-03-04 06:53:43,786 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:43,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.33ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 116.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:53:43,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.14ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 114.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:53:43,786 INFO L158 Benchmark]: Boogie Preprocessor took 17.22ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:53:43,786 INFO L158 Benchmark]: IcfgBuilder took 720.63ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 108.7MB in the end (delta: 4.2MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2025-03-04 06:53:43,786 INFO L158 Benchmark]: TraceAbstraction took 1879.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 107.7MB in the beginning and 148.8MB in the end (delta: -41.1MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2025-03-04 06:53:43,786 INFO L158 Benchmark]: Witness Printer took 66.44ms. Allocated memory is still 201.3MB. Free memory was 148.8MB in the beginning and 142.1MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:53:43,787 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.33ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 116.6MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.14ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 114.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.22ms. Allocated memory is still 167.8MB. Free memory was 114.2MB in the beginning and 112.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 720.63ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 108.7MB in the end (delta: 4.2MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1879.26ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 107.7MB in the beginning and 148.8MB in the end (delta: -41.1MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. * Witness Printer took 66.44ms. Allocated memory is still 201.3MB. Free memory was 148.8MB in the beginning and 142.1MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 242 locations, 65 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 40 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 38 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:53:43,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE