./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i -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 a7843ed292ba7ad810f8623eae57d1bf23212a957c35d700b564dc03a7df5581 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:57:37,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:57:37,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:57:37,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:57:37,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:57:37,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:57:37,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:57:37,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:57:37,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:57:37,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:57:37,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:57:37,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:57:37,373 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:57:37,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:57:37,374 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:57:37,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:37,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:57:37,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:57:37,375 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 -> a7843ed292ba7ad810f8623eae57d1bf23212a957c35d700b564dc03a7df5581 [2025-03-08 21:57:37,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:57:37,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:57:37,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:57:37,621 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:57:37,621 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:57:37,622 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-03-08 21:57:38,785 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf50b44a/848820e31aa14d4198fcd5ccab630beb/FLAGb627b83c6 [2025-03-08 21:57:39,116 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:57:39,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_15-list_entry_nr.i [2025-03-08 21:57:39,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf50b44a/848820e31aa14d4198fcd5ccab630beb/FLAGb627b83c6 [2025-03-08 21:57:39,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf50b44a/848820e31aa14d4198fcd5ccab630beb [2025-03-08 21:57:39,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:57:39,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:57:39,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:39,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:57:39,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:57:39,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2bb789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39, skipping insertion in model container [2025-03-08 21:57:39,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:57:39,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:39,435 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:57:39,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:57:39,502 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:57:39,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39 WrapperNode [2025-03-08 21:57:39,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:57:39,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:39,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:57:39,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:57:39,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,519 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,539 INFO L138 Inliner]: procedures = 186, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 94 [2025-03-08 21:57:39,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:57:39,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:57:39,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:57:39,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:57:39,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,547 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,547 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:57:39,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:57:39,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:57:39,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:57:39,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (1/1) ... [2025-03-08 21:57:39,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:57:39,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:57:39,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 21:57:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 21:57:39,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:57:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:57:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:57:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:57:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:57:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:57:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:57:39,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:57:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:57:39,617 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:57:39,712 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:57:39,714 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:57:39,890 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:57:39,890 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:57:39,911 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:57:39,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:57:39,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:39 BoogieIcfgContainer [2025-03-08 21:57:39,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:57:39,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:57:39,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:57:39,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:57:39,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:57:39" (1/3) ... [2025-03-08 21:57:39,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26512bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:39, skipping insertion in model container [2025-03-08 21:57:39,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:57:39" (2/3) ... [2025-03-08 21:57:39,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26512bc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:57:39, skipping insertion in model container [2025-03-08 21:57:39,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:39" (3/3) ... [2025-03-08 21:57:39,918 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_15-list_entry_nr.i [2025-03-08 21:57:39,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:57:39,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_15-list_entry_nr.i that has 2 procedures, 112 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-03-08 21:57:39,930 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:57:39,991 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:57:40,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 226 flow [2025-03-08 21:57:40,082 INFO L124 PetriNetUnfolderBase]: 0/110 cut-off events. [2025-03-08 21:57:40,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:40,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 110 events. 0/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-08 21:57:40,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 226 flow [2025-03-08 21:57:40,091 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 110 transitions, 223 flow [2025-03-08 21:57:40,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:57:40,111 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;@1ce4f80f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:57:40,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-08 21:57:40,116 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:57:40,116 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-08 21:57:40,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:40,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:40,117 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:40,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -854684129, now seen corresponding path program 1 times [2025-03-08 21:57:40,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326062394] [2025-03-08 21:57:40,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 21:57:40,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 21:57:40,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:40,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326062394] [2025-03-08 21:57:40,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326062394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:40,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:40,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:57:40,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683539435] [2025-03-08 21:57:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:40,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:40,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:40,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:40,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:40,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2025-03-08 21:57:40,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:40,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:40,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2025-03-08 21:57:40,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:40,437 INFO L124 PetriNetUnfolderBase]: 12/257 cut-off events. [2025-03-08 21:57:40,437 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:40,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 257 events. 12/257 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 718 event pairs, 12 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 252. Up to 37 conditions per place. [2025-03-08 21:57:40,440 INFO L140 encePairwiseOnDemand]: 108/111 looper letters, 12 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-03-08 21:57:40,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 249 flow [2025-03-08 21:57:40,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-03-08 21:57:40,454 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-03-08 21:57:40,456 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 223 flow. Second operand 3 states and 303 transitions. [2025-03-08 21:57:40,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 109 transitions, 249 flow [2025-03-08 21:57:40,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 109 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:40,464 INFO L231 Difference]: Finished difference. Result has 114 places, 109 transitions, 224 flow [2025-03-08 21:57:40,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=114, PETRI_TRANSITIONS=109} [2025-03-08 21:57:40,470 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2025-03-08 21:57:40,471 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 109 transitions, 224 flow [2025-03-08 21:57:40,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:40,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:40,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:57:40,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:40,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1762184962, now seen corresponding path program 1 times [2025-03-08 21:57:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016519026] [2025-03-08 21:57:40,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 21:57:40,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 21:57:40,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016519026] [2025-03-08 21:57:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016519026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:57:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643332192] [2025-03-08 21:57:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:40,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:57:40,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:40,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:57:40,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:57:40,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2025-03-08 21:57:40,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 109 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:40,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:40,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2025-03-08 21:57:40,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:40,582 INFO L124 PetriNetUnfolderBase]: 16/291 cut-off events. [2025-03-08 21:57:40,582 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:40,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 291 events. 16/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1017 event pairs, 16 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 323. Up to 43 conditions per place. [2025-03-08 21:57:40,587 INFO L140 encePairwiseOnDemand]: 107/111 looper letters, 11 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2025-03-08 21:57:40,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 106 transitions, 242 flow [2025-03-08 21:57:40,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:57:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:57:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-03-08 21:57:40,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2025-03-08 21:57:40,589 INFO L175 Difference]: Start difference. First operand has 114 places, 109 transitions, 224 flow. Second operand 3 states and 303 transitions. [2025-03-08 21:57:40,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 106 transitions, 242 flow [2025-03-08 21:57:40,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 106 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:57:40,592 INFO L231 Difference]: Finished difference. Result has 111 places, 106 transitions, 216 flow [2025-03-08 21:57:40,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=111, PETRI_TRANSITIONS=106} [2025-03-08 21:57:40,592 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-03-08 21:57:40,593 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 106 transitions, 216 flow [2025-03-08 21:57:40,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:40,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:40,593 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-08 21:57:40,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:57:40,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:40,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:40,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2094830680, now seen corresponding path program 1 times [2025-03-08 21:57:40,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:40,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468409862] [2025-03-08 21:57:40,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:40,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 21:57:40,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 21:57:40,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:40,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468409862] [2025-03-08 21:57:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468409862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:41,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:41,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212440716] [2025-03-08 21:57:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:41,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:41,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:41,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:41,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 111 [2025-03-08 21:57:41,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:41,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:41,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 111 [2025-03-08 21:57:41,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:41,233 INFO L124 PetriNetUnfolderBase]: 100/544 cut-off events. [2025-03-08 21:57:41,233 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:57:41,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 544 events. 100/544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2872 event pairs, 100 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 763. Up to 227 conditions per place. [2025-03-08 21:57:41,239 INFO L140 encePairwiseOnDemand]: 105/111 looper letters, 26 selfloop transitions, 5 changer transitions 0/105 dead transitions. [2025-03-08 21:57:41,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 105 transitions, 276 flow [2025-03-08 21:57:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2025-03-08 21:57:41,242 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7597597597597597 [2025-03-08 21:57:41,242 INFO L175 Difference]: Start difference. First operand has 111 places, 106 transitions, 216 flow. Second operand 6 states and 506 transitions. [2025-03-08 21:57:41,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 105 transitions, 276 flow [2025-03-08 21:57:41,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 105 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:57:41,244 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 223 flow [2025-03-08 21:57:41,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2025-03-08 21:57:41,246 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 0 predicate places. [2025-03-08 21:57:41,246 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 223 flow [2025-03-08 21:57:41,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:41,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:41,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] [2025-03-08 21:57:41,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:57:41,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:41,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1257354314, now seen corresponding path program 1 times [2025-03-08 21:57:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:41,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449813630] [2025-03-08 21:57:41,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:41,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 21:57:41,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 21:57:41,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:41,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:41,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449813630] [2025-03-08 21:57:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449813630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209675323] [2025-03-08 21:57:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:41,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:41,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:41,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 111 [2025-03-08 21:57:41,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:41,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:41,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 111 [2025-03-08 21:57:41,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:41,854 INFO L124 PetriNetUnfolderBase]: 114/573 cut-off events. [2025-03-08 21:57:41,854 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:57:41,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844 conditions, 573 events. 114/573 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3163 event pairs, 61 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 826. Up to 211 conditions per place. [2025-03-08 21:57:41,857 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 34 selfloop transitions, 22 changer transitions 0/134 dead transitions. [2025-03-08 21:57:41,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 134 transitions, 393 flow [2025-03-08 21:57:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 561 transitions. [2025-03-08 21:57:41,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8423423423423423 [2025-03-08 21:57:41,861 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 223 flow. Second operand 6 states and 561 transitions. [2025-03-08 21:57:41,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 134 transitions, 393 flow [2025-03-08 21:57:41,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 134 transitions, 383 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:41,865 INFO L231 Difference]: Finished difference. Result has 119 places, 126 transitions, 363 flow [2025-03-08 21:57:41,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=119, PETRI_TRANSITIONS=126} [2025-03-08 21:57:41,866 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-03-08 21:57:41,866 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 126 transitions, 363 flow [2025-03-08 21:57:41,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:41,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:41,867 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-08 21:57:41,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:57:41,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:41,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -698275047, now seen corresponding path program 1 times [2025-03-08 21:57:41,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:41,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498772934] [2025-03-08 21:57:41,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:41,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:41,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 21:57:41,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 21:57:41,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:41,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:57:42,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:42,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498772934] [2025-03-08 21:57:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498772934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:42,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:42,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557937935] [2025-03-08 21:57:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:42,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:42,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:42,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:42,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 111 [2025-03-08 21:57:42,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 126 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:42,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:42,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 111 [2025-03-08 21:57:42,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:42,444 INFO L124 PetriNetUnfolderBase]: 152/680 cut-off events. [2025-03-08 21:57:42,444 INFO L125 PetriNetUnfolderBase]: For 143/163 co-relation queries the response was YES. [2025-03-08 21:57:42,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 680 events. 152/680 cut-off events. For 143/163 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4005 event pairs, 61 based on Foata normal form. 5/655 useless extension candidates. Maximal degree in co-relation 1181. Up to 268 conditions per place. [2025-03-08 21:57:42,447 INFO L140 encePairwiseOnDemand]: 100/111 looper letters, 47 selfloop transitions, 26 changer transitions 0/155 dead transitions. [2025-03-08 21:57:42,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 155 transitions, 585 flow [2025-03-08 21:57:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:42,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 561 transitions. [2025-03-08 21:57:42,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8423423423423423 [2025-03-08 21:57:42,448 INFO L175 Difference]: Start difference. First operand has 119 places, 126 transitions, 363 flow. Second operand 6 states and 561 transitions. [2025-03-08 21:57:42,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 155 transitions, 585 flow [2025-03-08 21:57:42,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 155 transitions, 585 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:42,451 INFO L231 Difference]: Finished difference. Result has 129 places, 147 transitions, 547 flow [2025-03-08 21:57:42,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=129, PETRI_TRANSITIONS=147} [2025-03-08 21:57:42,452 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 15 predicate places. [2025-03-08 21:57:42,452 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 147 transitions, 547 flow [2025-03-08 21:57:42,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:42,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:42,453 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] [2025-03-08 21:57:42,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:57:42,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:42,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 774684090, now seen corresponding path program 1 times [2025-03-08 21:57:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88670642] [2025-03-08 21:57:42,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:42,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 21:57:42,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 21:57:42,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:42,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:42,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:42,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:42,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88670642] [2025-03-08 21:57:42,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88670642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:42,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:42,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:42,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027327717] [2025-03-08 21:57:42,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:42,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:42,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:42,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:42,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:42,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 111 [2025-03-08 21:57:42,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 147 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:42,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:42,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 111 [2025-03-08 21:57:42,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:42,943 INFO L124 PetriNetUnfolderBase]: 292/1078 cut-off events. [2025-03-08 21:57:42,944 INFO L125 PetriNetUnfolderBase]: For 577/599 co-relation queries the response was YES. [2025-03-08 21:57:42,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 1078 events. 292/1078 cut-off events. For 577/599 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 6908 event pairs, 101 based on Foata normal form. 9/1039 useless extension candidates. Maximal degree in co-relation 2418. Up to 532 conditions per place. [2025-03-08 21:57:42,952 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 72 selfloop transitions, 53 changer transitions 4/202 dead transitions. [2025-03-08 21:57:42,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 202 transitions, 1049 flow [2025-03-08 21:57:42,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-03-08 21:57:42,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213213213213213 [2025-03-08 21:57:42,955 INFO L175 Difference]: Start difference. First operand has 129 places, 147 transitions, 547 flow. Second operand 6 states and 547 transitions. [2025-03-08 21:57:42,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 202 transitions, 1049 flow [2025-03-08 21:57:42,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 202 transitions, 1049 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:42,965 INFO L231 Difference]: Finished difference. Result has 139 places, 194 transitions, 1029 flow [2025-03-08 21:57:42,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1029, PETRI_PLACES=139, PETRI_TRANSITIONS=194} [2025-03-08 21:57:42,966 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 25 predicate places. [2025-03-08 21:57:42,967 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 194 transitions, 1029 flow [2025-03-08 21:57:42,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:42,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:42,967 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-08 21:57:42,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:57:42,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:42,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:42,968 INFO L85 PathProgramCache]: Analyzing trace with hash 432842355, now seen corresponding path program 1 times [2025-03-08 21:57:42,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:42,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900453355] [2025-03-08 21:57:42,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:42,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 21:57:42,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 21:57:42,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:42,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:43,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900453355] [2025-03-08 21:57:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900453355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:43,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:43,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:57:43,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150010441] [2025-03-08 21:57:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:43,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:57:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:43,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:57:43,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:57:43,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 111 [2025-03-08 21:57:43,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 194 transitions, 1029 flow. Second operand has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:43,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:43,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 111 [2025-03-08 21:57:43,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:43,452 INFO L124 PetriNetUnfolderBase]: 396/1383 cut-off events. [2025-03-08 21:57:43,452 INFO L125 PetriNetUnfolderBase]: For 1632/1673 co-relation queries the response was YES. [2025-03-08 21:57:43,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3760 conditions, 1383 events. 396/1383 cut-off events. For 1632/1673 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9362 event pairs, 107 based on Foata normal form. 4/1351 useless extension candidates. Maximal degree in co-relation 3728. Up to 677 conditions per place. [2025-03-08 21:57:43,459 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 109 selfloop transitions, 61 changer transitions 10/255 dead transitions. [2025-03-08 21:57:43,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 255 transitions, 1735 flow [2025-03-08 21:57:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:57:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:57:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2025-03-08 21:57:43,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8213213213213213 [2025-03-08 21:57:43,461 INFO L175 Difference]: Start difference. First operand has 139 places, 194 transitions, 1029 flow. Second operand 6 states and 547 transitions. [2025-03-08 21:57:43,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 255 transitions, 1735 flow [2025-03-08 21:57:43,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 255 transitions, 1671 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:43,471 INFO L231 Difference]: Finished difference. Result has 149 places, 241 transitions, 1551 flow [2025-03-08 21:57:43,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1551, PETRI_PLACES=149, PETRI_TRANSITIONS=241} [2025-03-08 21:57:43,472 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 35 predicate places. [2025-03-08 21:57:43,472 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 241 transitions, 1551 flow [2025-03-08 21:57:43,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.16666666666667) internal successors, (487), 6 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:43,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:43,472 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] [2025-03-08 21:57:43,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:57:43,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:43,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:43,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1827911745, now seen corresponding path program 1 times [2025-03-08 21:57:43,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:43,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131764280] [2025-03-08 21:57:43,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:43,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:57:43,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:57:43,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:43,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131764280] [2025-03-08 21:57:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131764280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:44,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:44,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141905071] [2025-03-08 21:57:44,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:44,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:44,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:44,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:44,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:44,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 241 transitions, 1551 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:44,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:44,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:44,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:45,432 INFO L124 PetriNetUnfolderBase]: 618/2294 cut-off events. [2025-03-08 21:57:45,432 INFO L125 PetriNetUnfolderBase]: For 2982/3033 co-relation queries the response was YES. [2025-03-08 21:57:45,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6493 conditions, 2294 events. 618/2294 cut-off events. For 2982/3033 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 18379 event pairs, 36 based on Foata normal form. 6/2286 useless extension candidates. Maximal degree in co-relation 6451. Up to 366 conditions per place. [2025-03-08 21:57:45,448 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 40 selfloop transitions, 18 changer transitions 18/288 dead transitions. [2025-03-08 21:57:45,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 288 transitions, 1797 flow [2025-03-08 21:57:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1143 transitions. [2025-03-08 21:57:45,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7920997920997921 [2025-03-08 21:57:45,455 INFO L175 Difference]: Start difference. First operand has 149 places, 241 transitions, 1551 flow. Second operand 13 states and 1143 transitions. [2025-03-08 21:57:45,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 288 transitions, 1797 flow [2025-03-08 21:57:45,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 288 transitions, 1729 flow, removed 34 selfloop flow, removed 0 redundant places. [2025-03-08 21:57:45,481 INFO L231 Difference]: Finished difference. Result has 168 places, 250 transitions, 1582 flow [2025-03-08 21:57:45,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1483, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1582, PETRI_PLACES=168, PETRI_TRANSITIONS=250} [2025-03-08 21:57:45,483 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 54 predicate places. [2025-03-08 21:57:45,484 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 250 transitions, 1582 flow [2025-03-08 21:57:45,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:45,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:45,485 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] [2025-03-08 21:57:45,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:57:45,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:45,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:45,486 INFO L85 PathProgramCache]: Analyzing trace with hash 152129739, now seen corresponding path program 2 times [2025-03-08 21:57:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-03-08 21:57:45,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:45,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:45,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:57:45,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:57:45,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:45,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:46,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:46,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113205323] [2025-03-08 21:57:46,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113205323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:46,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:46,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:46,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660279095] [2025-03-08 21:57:46,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:46,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:46,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:46,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:46,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:46,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:46,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 250 transitions, 1582 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:46,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:46,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:46,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:47,086 INFO L124 PetriNetUnfolderBase]: 620/2370 cut-off events. [2025-03-08 21:57:47,087 INFO L125 PetriNetUnfolderBase]: For 3345/3424 co-relation queries the response was YES. [2025-03-08 21:57:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7125 conditions, 2370 events. 620/2370 cut-off events. For 3345/3424 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19169 event pairs, 37 based on Foata normal form. 13/2374 useless extension candidates. Maximal degree in co-relation 7072. Up to 366 conditions per place. [2025-03-08 21:57:47,101 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 34 selfloop transitions, 23 changer transitions 24/293 dead transitions. [2025-03-08 21:57:47,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 293 transitions, 1914 flow [2025-03-08 21:57:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1139 transitions. [2025-03-08 21:57:47,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7893277893277894 [2025-03-08 21:57:47,104 INFO L175 Difference]: Start difference. First operand has 168 places, 250 transitions, 1582 flow. Second operand 13 states and 1139 transitions. [2025-03-08 21:57:47,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 293 transitions, 1914 flow [2025-03-08 21:57:47,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 293 transitions, 1889 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:57:47,123 INFO L231 Difference]: Finished difference. Result has 177 places, 250 transitions, 1625 flow [2025-03-08 21:57:47,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1565, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1625, PETRI_PLACES=177, PETRI_TRANSITIONS=250} [2025-03-08 21:57:47,125 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 63 predicate places. [2025-03-08 21:57:47,125 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 250 transitions, 1625 flow [2025-03-08 21:57:47,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:47,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:47,126 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] [2025-03-08 21:57:47,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:57:47,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:47,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:47,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1160413243, now seen corresponding path program 3 times [2025-03-08 21:57:47,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457289404] [2025-03-08 21:57:47,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:57:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:47,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:57:47,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:57:47,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:57:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457289404] [2025-03-08 21:57:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457289404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709585835] [2025-03-08 21:57:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:47,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:47,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:47,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:48,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:48,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 250 transitions, 1625 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:48,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:48,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:48,509 INFO L124 PetriNetUnfolderBase]: 563/2153 cut-off events. [2025-03-08 21:57:48,510 INFO L125 PetriNetUnfolderBase]: For 3525/3616 co-relation queries the response was YES. [2025-03-08 21:57:48,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6757 conditions, 2153 events. 563/2153 cut-off events. For 3525/3616 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16992 event pairs, 21 based on Foata normal form. 12/2159 useless extension candidates. Maximal degree in co-relation 6700. Up to 368 conditions per place. [2025-03-08 21:57:48,522 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 42 selfloop transitions, 19 changer transitions 16/289 dead transitions. [2025-03-08 21:57:48,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 289 transitions, 2009 flow [2025-03-08 21:57:48,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:48,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1137 transitions. [2025-03-08 21:57:48,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7879417879417879 [2025-03-08 21:57:48,525 INFO L175 Difference]: Start difference. First operand has 177 places, 250 transitions, 1625 flow. Second operand 13 states and 1137 transitions. [2025-03-08 21:57:48,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 289 transitions, 2009 flow [2025-03-08 21:57:48,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 289 transitions, 1909 flow, removed 9 selfloop flow, removed 11 redundant places. [2025-03-08 21:57:48,542 INFO L231 Difference]: Finished difference. Result has 182 places, 255 transitions, 1673 flow [2025-03-08 21:57:48,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1673, PETRI_PLACES=182, PETRI_TRANSITIONS=255} [2025-03-08 21:57:48,543 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 68 predicate places. [2025-03-08 21:57:48,543 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 255 transitions, 1673 flow [2025-03-08 21:57:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:48,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:48,546 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] [2025-03-08 21:57:48,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:57:48,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:48,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 972184099, now seen corresponding path program 4 times [2025-03-08 21:57:48,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:48,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303186564] [2025-03-08 21:57:48,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:57:48,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:48,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:57:48,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:57:48,571 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:57:48,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:48,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:48,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303186564] [2025-03-08 21:57:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303186564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:48,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:57:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014080672] [2025-03-08 21:57:48,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:48,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:57:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:48,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:57:48,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:57:49,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-03-08 21:57:49,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 255 transitions, 1673 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:49,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:49,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-03-08 21:57:49,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:51,087 INFO L124 PetriNetUnfolderBase]: 1519/4718 cut-off events. [2025-03-08 21:57:51,088 INFO L125 PetriNetUnfolderBase]: For 13877/14158 co-relation queries the response was YES. [2025-03-08 21:57:51,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17368 conditions, 4718 events. 1519/4718 cut-off events. For 13877/14158 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 41565 event pairs, 108 based on Foata normal form. 104/4796 useless extension candidates. Maximal degree in co-relation 17310. Up to 1137 conditions per place. [2025-03-08 21:57:51,122 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 454 selfloop transitions, 120 changer transitions 45/711 dead transitions. [2025-03-08 21:57:51,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 711 transitions, 6720 flow [2025-03-08 21:57:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 21:57:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-08 21:57:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2023 transitions. [2025-03-08 21:57:51,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.729009009009009 [2025-03-08 21:57:51,126 INFO L175 Difference]: Start difference. First operand has 182 places, 255 transitions, 1673 flow. Second operand 25 states and 2023 transitions. [2025-03-08 21:57:51,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 711 transitions, 6720 flow [2025-03-08 21:57:51,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 711 transitions, 6577 flow, removed 61 selfloop flow, removed 9 redundant places. [2025-03-08 21:57:51,174 INFO L231 Difference]: Finished difference. Result has 215 places, 356 transitions, 3121 flow [2025-03-08 21:57:51,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3121, PETRI_PLACES=215, PETRI_TRANSITIONS=356} [2025-03-08 21:57:51,175 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 101 predicate places. [2025-03-08 21:57:51,175 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 356 transitions, 3121 flow [2025-03-08 21:57:51,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:51,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:51,176 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] [2025-03-08 21:57:51,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:57:51,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1421721671, now seen corresponding path program 5 times [2025-03-08 21:57:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154943725] [2025-03-08 21:57:51,177 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:57:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:51,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:57:51,194 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:57:51,194 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:57:51,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:51,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:51,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154943725] [2025-03-08 21:57:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154943725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:51,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:51,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140536084] [2025-03-08 21:57:51,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:51,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:51,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:51,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:51,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:52,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:52,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 356 transitions, 3121 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:52,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:52,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:52,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:52,742 INFO L124 PetriNetUnfolderBase]: 1371/4714 cut-off events. [2025-03-08 21:57:52,742 INFO L125 PetriNetUnfolderBase]: For 13594/13831 co-relation queries the response was YES. [2025-03-08 21:57:52,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16667 conditions, 4714 events. 1371/4714 cut-off events. For 13594/13831 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 45010 event pairs, 57 based on Foata normal form. 38/4736 useless extension candidates. Maximal degree in co-relation 16593. Up to 884 conditions per place. [2025-03-08 21:57:52,772 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 64 selfloop transitions, 29 changer transitions 6/385 dead transitions. [2025-03-08 21:57:52,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 385 transitions, 3516 flow [2025-03-08 21:57:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1132 transitions. [2025-03-08 21:57:52,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7844767844767845 [2025-03-08 21:57:52,775 INFO L175 Difference]: Start difference. First operand has 215 places, 356 transitions, 3121 flow. Second operand 13 states and 1132 transitions. [2025-03-08 21:57:52,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 385 transitions, 3516 flow [2025-03-08 21:57:52,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 385 transitions, 3443 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-03-08 21:57:52,841 INFO L231 Difference]: Finished difference. Result has 226 places, 359 transitions, 3159 flow [2025-03-08 21:57:52,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3061, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3159, PETRI_PLACES=226, PETRI_TRANSITIONS=359} [2025-03-08 21:57:52,842 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 112 predicate places. [2025-03-08 21:57:52,842 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 359 transitions, 3159 flow [2025-03-08 21:57:52,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:52,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:52,842 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] [2025-03-08 21:57:52,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:57:52,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:52,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash -890396993, now seen corresponding path program 6 times [2025-03-08 21:57:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:52,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128532710] [2025-03-08 21:57:52,843 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:57:52,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:52,851 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:57:52,857 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:57:52,857 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:57:52,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:53,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128532710] [2025-03-08 21:57:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128532710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:53,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:53,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:53,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923667893] [2025-03-08 21:57:53,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:53,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:53,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:53,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:53,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:53,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 359 transitions, 3159 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:53,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:53,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:53,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:54,487 INFO L124 PetriNetUnfolderBase]: 1642/5637 cut-off events. [2025-03-08 21:57:54,487 INFO L125 PetriNetUnfolderBase]: For 16664/16969 co-relation queries the response was YES. [2025-03-08 21:57:54,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20135 conditions, 5637 events. 1642/5637 cut-off events. For 16664/16969 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 55794 event pairs, 76 based on Foata normal form. 31/5648 useless extension candidates. Maximal degree in co-relation 20056. Up to 1026 conditions per place. [2025-03-08 21:57:54,525 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 69 selfloop transitions, 35 changer transitions 4/394 dead transitions. [2025-03-08 21:57:54,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 394 transitions, 3669 flow [2025-03-08 21:57:54,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1132 transitions. [2025-03-08 21:57:54,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7844767844767845 [2025-03-08 21:57:54,527 INFO L175 Difference]: Start difference. First operand has 226 places, 359 transitions, 3159 flow. Second operand 13 states and 1132 transitions. [2025-03-08 21:57:54,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 394 transitions, 3669 flow [2025-03-08 21:57:54,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 394 transitions, 3596 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-08 21:57:54,612 INFO L231 Difference]: Finished difference. Result has 234 places, 367 transitions, 3311 flow [2025-03-08 21:57:54,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3107, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3311, PETRI_PLACES=234, PETRI_TRANSITIONS=367} [2025-03-08 21:57:54,613 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 120 predicate places. [2025-03-08 21:57:54,613 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 367 transitions, 3311 flow [2025-03-08 21:57:54,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:54,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:54,614 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] [2025-03-08 21:57:54,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:57:54,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:54,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 184438349, now seen corresponding path program 7 times [2025-03-08 21:57:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471024971] [2025-03-08 21:57:54,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:57:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:54,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:57:54,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:57:54,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:54,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471024971] [2025-03-08 21:57:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471024971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:55,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869795081] [2025-03-08 21:57:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:55,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:55,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:55,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:55,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 367 transitions, 3311 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:55,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:55,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:55,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:56,162 INFO L124 PetriNetUnfolderBase]: 1909/6546 cut-off events. [2025-03-08 21:57:56,163 INFO L125 PetriNetUnfolderBase]: For 20671/20983 co-relation queries the response was YES. [2025-03-08 21:57:56,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23664 conditions, 6546 events. 1909/6546 cut-off events. For 20671/20983 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 66983 event pairs, 85 based on Foata normal form. 44/6566 useless extension candidates. Maximal degree in co-relation 23580. Up to 1198 conditions per place. [2025-03-08 21:57:56,212 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 72 selfloop transitions, 36 changer transitions 4/398 dead transitions. [2025-03-08 21:57:56,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 398 transitions, 3833 flow [2025-03-08 21:57:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1131 transitions. [2025-03-08 21:57:56,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837837837837838 [2025-03-08 21:57:56,214 INFO L175 Difference]: Start difference. First operand has 234 places, 367 transitions, 3311 flow. Second operand 13 states and 1131 transitions. [2025-03-08 21:57:56,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 398 transitions, 3833 flow [2025-03-08 21:57:56,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 398 transitions, 3751 flow, removed 21 selfloop flow, removed 8 redundant places. [2025-03-08 21:57:56,317 INFO L231 Difference]: Finished difference. Result has 241 places, 375 transitions, 3463 flow [2025-03-08 21:57:56,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3252, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3463, PETRI_PLACES=241, PETRI_TRANSITIONS=375} [2025-03-08 21:57:56,318 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 127 predicate places. [2025-03-08 21:57:56,318 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 375 transitions, 3463 flow [2025-03-08 21:57:56,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:56,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:56,318 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] [2025-03-08 21:57:56,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:57:56,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:56,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:56,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1305467887, now seen corresponding path program 8 times [2025-03-08 21:57:56,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:56,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930820373] [2025-03-08 21:57:56,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:57:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:56,326 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:57:56,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:57:56,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:57:56,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:56,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:56,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930820373] [2025-03-08 21:57:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930820373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599376710] [2025-03-08 21:57:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:56,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:56,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:56,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:57,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:57,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 375 transitions, 3463 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:57,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:57,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:57,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:57,886 INFO L124 PetriNetUnfolderBase]: 1910/6547 cut-off events. [2025-03-08 21:57:57,886 INFO L125 PetriNetUnfolderBase]: For 22404/22770 co-relation queries the response was YES. [2025-03-08 21:57:57,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23936 conditions, 6547 events. 1910/6547 cut-off events. For 22404/22770 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 66893 event pairs, 83 based on Foata normal form. 48/6571 useless extension candidates. Maximal degree in co-relation 23849. Up to 1190 conditions per place. [2025-03-08 21:57:57,937 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 73 selfloop transitions, 37 changer transitions 5/401 dead transitions. [2025-03-08 21:57:57,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 401 transitions, 3930 flow [2025-03-08 21:57:57,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1135 transitions. [2025-03-08 21:57:57,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865557865557865 [2025-03-08 21:57:57,939 INFO L175 Difference]: Start difference. First operand has 241 places, 375 transitions, 3463 flow. Second operand 13 states and 1135 transitions. [2025-03-08 21:57:57,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 401 transitions, 3930 flow [2025-03-08 21:57:58,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 401 transitions, 3847 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-03-08 21:57:58,055 INFO L231 Difference]: Finished difference. Result has 249 places, 378 transitions, 3545 flow [2025-03-08 21:57:58,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3545, PETRI_PLACES=249, PETRI_TRANSITIONS=378} [2025-03-08 21:57:58,056 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 135 predicate places. [2025-03-08 21:57:58,057 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 378 transitions, 3545 flow [2025-03-08 21:57:58,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:58,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:58,057 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] [2025-03-08 21:57:58,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:57:58,057 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:58,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:58,058 INFO L85 PathProgramCache]: Analyzing trace with hash 811846809, now seen corresponding path program 9 times [2025-03-08 21:57:58,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:58,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866770380] [2025-03-08 21:57:58,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:57:58,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:58,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:57:58,071 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:57:58,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:57:58,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:57:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:57:58,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:57:58,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866770380] [2025-03-08 21:57:58,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866770380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:57:58,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:57:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:57:58,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267021790] [2025-03-08 21:57:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:57:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:57:58,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:57:58,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:57:58,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:57:58,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:57:58,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 378 transitions, 3545 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:58,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:57:58,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:57:58,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:57:59,552 INFO L124 PetriNetUnfolderBase]: 1911/6522 cut-off events. [2025-03-08 21:57:59,552 INFO L125 PetriNetUnfolderBase]: For 23503/23862 co-relation queries the response was YES. [2025-03-08 21:57:59,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24041 conditions, 6522 events. 1911/6522 cut-off events. For 23503/23862 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 66614 event pairs, 88 based on Foata normal form. 40/6536 useless extension candidates. Maximal degree in co-relation 23950. Up to 1200 conditions per place. [2025-03-08 21:57:59,600 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 77 selfloop transitions, 31 changer transitions 3/397 dead transitions. [2025-03-08 21:57:59,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 397 transitions, 3963 flow [2025-03-08 21:57:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:57:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:57:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1138 transitions. [2025-03-08 21:57:59,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7886347886347886 [2025-03-08 21:57:59,602 INFO L175 Difference]: Start difference. First operand has 249 places, 378 transitions, 3545 flow. Second operand 13 states and 1138 transitions. [2025-03-08 21:57:59,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 397 transitions, 3963 flow [2025-03-08 21:57:59,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 397 transitions, 3796 flow, removed 43 selfloop flow, removed 13 redundant places. [2025-03-08 21:57:59,710 INFO L231 Difference]: Finished difference. Result has 251 places, 381 transitions, 3555 flow [2025-03-08 21:57:59,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3425, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3555, PETRI_PLACES=251, PETRI_TRANSITIONS=381} [2025-03-08 21:57:59,711 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 137 predicate places. [2025-03-08 21:57:59,711 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 381 transitions, 3555 flow [2025-03-08 21:57:59,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:57:59,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:57:59,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:57:59,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:57:59,711 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:57:59,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:57:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash 392937474, now seen corresponding path program 1 times [2025-03-08 21:57:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:57:59,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202787420] [2025-03-08 21:57:59,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:57:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:57:59,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:57:59,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:57:59,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:57:59,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:00,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202787420] [2025-03-08 21:58:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202787420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:00,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828996360] [2025-03-08 21:58:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:00,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:00,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:00,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:00,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 381 transitions, 3555 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:00,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:00,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:00,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:01,343 INFO L124 PetriNetUnfolderBase]: 2174/7389 cut-off events. [2025-03-08 21:58:01,343 INFO L125 PetriNetUnfolderBase]: For 27440/27828 co-relation queries the response was YES. [2025-03-08 21:58:01,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27120 conditions, 7389 events. 2174/7389 cut-off events. For 27440/27828 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 77321 event pairs, 97 based on Foata normal form. 42/7401 useless extension candidates. Maximal degree in co-relation 27031. Up to 1368 conditions per place. [2025-03-08 21:58:01,398 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 83 selfloop transitions, 34 changer transitions 3/406 dead transitions. [2025-03-08 21:58:01,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 406 transitions, 4070 flow [2025-03-08 21:58:01,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:01,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1139 transitions. [2025-03-08 21:58:01,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7893277893277894 [2025-03-08 21:58:01,400 INFO L175 Difference]: Start difference. First operand has 251 places, 381 transitions, 3555 flow. Second operand 13 states and 1139 transitions. [2025-03-08 21:58:01,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 406 transitions, 4070 flow [2025-03-08 21:58:01,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 406 transitions, 3962 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:01,532 INFO L231 Difference]: Finished difference. Result has 258 places, 387 transitions, 3670 flow [2025-03-08 21:58:01,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3488, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3670, PETRI_PLACES=258, PETRI_TRANSITIONS=387} [2025-03-08 21:58:01,533 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 144 predicate places. [2025-03-08 21:58:01,533 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 387 transitions, 3670 flow [2025-03-08 21:58:01,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:01,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:01,533 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] [2025-03-08 21:58:01,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:58:01,533 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:01,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 736966750, now seen corresponding path program 2 times [2025-03-08 21:58:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046734090] [2025-03-08 21:58:01,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:01,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:01,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:01,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:01,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046734090] [2025-03-08 21:58:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046734090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:01,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781775638] [2025-03-08 21:58:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:01,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:01,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:01,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:02,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:02,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 387 transitions, 3670 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:02,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:02,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:02,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:03,143 INFO L124 PetriNetUnfolderBase]: 2174/7407 cut-off events. [2025-03-08 21:58:03,144 INFO L125 PetriNetUnfolderBase]: For 27784/28172 co-relation queries the response was YES. [2025-03-08 21:58:03,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27244 conditions, 7407 events. 2174/7407 cut-off events. For 27784/28172 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 77502 event pairs, 100 based on Foata normal form. 39/7416 useless extension candidates. Maximal degree in co-relation 27152. Up to 1371 conditions per place. [2025-03-08 21:58:03,191 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 81 selfloop transitions, 31 changer transitions 5/403 dead transitions. [2025-03-08 21:58:03,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 403 transitions, 4038 flow [2025-03-08 21:58:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1139 transitions. [2025-03-08 21:58:03,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7893277893277894 [2025-03-08 21:58:03,193 INFO L175 Difference]: Start difference. First operand has 258 places, 387 transitions, 3670 flow. Second operand 13 states and 1139 transitions. [2025-03-08 21:58:03,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 403 transitions, 4038 flow [2025-03-08 21:58:03,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 403 transitions, 3976 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-03-08 21:58:03,313 INFO L231 Difference]: Finished difference. Result has 263 places, 387 transitions, 3691 flow [2025-03-08 21:58:03,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3691, PETRI_PLACES=263, PETRI_TRANSITIONS=387} [2025-03-08 21:58:03,313 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 149 predicate places. [2025-03-08 21:58:03,313 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 387 transitions, 3691 flow [2025-03-08 21:58:03,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:03,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:03,314 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] [2025-03-08 21:58:03,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:58:03,314 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:03,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:03,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1737097820, now seen corresponding path program 3 times [2025-03-08 21:58:03,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:03,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677005018] [2025-03-08 21:58:03,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:03,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:03,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:03,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:03,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:03,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677005018] [2025-03-08 21:58:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677005018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:03,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:03,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232159551] [2025-03-08 21:58:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:03,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:03,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:03,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:04,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:04,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 387 transitions, 3691 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:04,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:04,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:04,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:04,830 INFO L124 PetriNetUnfolderBase]: 1907/6567 cut-off events. [2025-03-08 21:58:04,830 INFO L125 PetriNetUnfolderBase]: For 24507/24856 co-relation queries the response was YES. [2025-03-08 21:58:04,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24111 conditions, 6567 events. 1907/6567 cut-off events. For 24507/24856 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 67371 event pairs, 87 based on Foata normal form. 35/6576 useless extension candidates. Maximal degree in co-relation 24017. Up to 1208 conditions per place. [2025-03-08 21:58:04,869 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 78 selfloop transitions, 28 changer transitions 9/401 dead transitions. [2025-03-08 21:58:04,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 401 transitions, 4001 flow [2025-03-08 21:58:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1135 transitions. [2025-03-08 21:58:04,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865557865557865 [2025-03-08 21:58:04,872 INFO L175 Difference]: Start difference. First operand has 263 places, 387 transitions, 3691 flow. Second operand 13 states and 1135 transitions. [2025-03-08 21:58:04,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 401 transitions, 4001 flow [2025-03-08 21:58:04,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 401 transitions, 3918 flow, removed 8 selfloop flow, removed 12 redundant places. [2025-03-08 21:58:04,980 INFO L231 Difference]: Finished difference. Result has 264 places, 381 transitions, 3574 flow [2025-03-08 21:58:04,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3540, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3574, PETRI_PLACES=264, PETRI_TRANSITIONS=381} [2025-03-08 21:58:04,981 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 150 predicate places. [2025-03-08 21:58:04,981 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 381 transitions, 3574 flow [2025-03-08 21:58:04,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:04,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:04,982 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] [2025-03-08 21:58:04,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:58:04,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:04,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash -292962586, now seen corresponding path program 4 times [2025-03-08 21:58:04,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:04,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71324282] [2025-03-08 21:58:04,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:04,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:04,988 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:04,994 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:04,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:04,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:05,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:05,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71324282] [2025-03-08 21:58:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71324282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784270989] [2025-03-08 21:58:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:05,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:05,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:05,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:05,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:05,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 381 transitions, 3574 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:05,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:05,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:05,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:06,559 INFO L124 PetriNetUnfolderBase]: 1906/6530 cut-off events. [2025-03-08 21:58:06,559 INFO L125 PetriNetUnfolderBase]: For 24005/24348 co-relation queries the response was YES. [2025-03-08 21:58:06,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23886 conditions, 6530 events. 1906/6530 cut-off events. For 24005/24348 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 66774 event pairs, 88 based on Foata normal form. 37/6541 useless extension candidates. Maximal degree in co-relation 23791. Up to 1196 conditions per place. [2025-03-08 21:58:06,610 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 74 selfloop transitions, 31 changer transitions 5/396 dead transitions. [2025-03-08 21:58:06,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 396 transitions, 3935 flow [2025-03-08 21:58:06,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:06,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:06,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1138 transitions. [2025-03-08 21:58:06,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7886347886347886 [2025-03-08 21:58:06,611 INFO L175 Difference]: Start difference. First operand has 264 places, 381 transitions, 3574 flow. Second operand 13 states and 1138 transitions. [2025-03-08 21:58:06,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 396 transitions, 3935 flow [2025-03-08 21:58:06,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 396 transitions, 3841 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-03-08 21:58:06,716 INFO L231 Difference]: Finished difference. Result has 258 places, 381 transitions, 3570 flow [2025-03-08 21:58:06,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3501, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3570, PETRI_PLACES=258, PETRI_TRANSITIONS=381} [2025-03-08 21:58:06,716 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 144 predicate places. [2025-03-08 21:58:06,716 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 381 transitions, 3570 flow [2025-03-08 21:58:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:06,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:06,717 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] [2025-03-08 21:58:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 21:58:06,717 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:06,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:06,717 INFO L85 PathProgramCache]: Analyzing trace with hash -305339652, now seen corresponding path program 5 times [2025-03-08 21:58:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027355062] [2025-03-08 21:58:06,717 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:06,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:06,724 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:06,728 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:06,728 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:06,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:06,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027355062] [2025-03-08 21:58:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027355062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252280346] [2025-03-08 21:58:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:06,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:06,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:06,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:07,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:07,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 381 transitions, 3570 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:07,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:07,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:07,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:08,135 INFO L124 PetriNetUnfolderBase]: 1637/5690 cut-off events. [2025-03-08 21:58:08,135 INFO L125 PetriNetUnfolderBase]: For 20288/20591 co-relation queries the response was YES. [2025-03-08 21:58:08,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20744 conditions, 5690 events. 1637/5690 cut-off events. For 20288/20591 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 56564 event pairs, 77 based on Foata normal form. 30/5698 useless extension candidates. Maximal degree in co-relation 20652. Up to 1035 conditions per place. [2025-03-08 21:58:08,171 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 70 selfloop transitions, 23 changer transitions 10/389 dead transitions. [2025-03-08 21:58:08,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 389 transitions, 3794 flow [2025-03-08 21:58:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1134 transitions. [2025-03-08 21:58:08,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7858627858627859 [2025-03-08 21:58:08,172 INFO L175 Difference]: Start difference. First operand has 258 places, 381 transitions, 3570 flow. Second operand 13 states and 1134 transitions. [2025-03-08 21:58:08,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 389 transitions, 3794 flow [2025-03-08 21:58:08,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 389 transitions, 3691 flow, removed 10 selfloop flow, removed 14 redundant places. [2025-03-08 21:58:08,271 INFO L231 Difference]: Finished difference. Result has 255 places, 371 transitions, 3372 flow [2025-03-08 21:58:08,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3401, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3372, PETRI_PLACES=255, PETRI_TRANSITIONS=371} [2025-03-08 21:58:08,272 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 141 predicate places. [2025-03-08 21:58:08,272 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 371 transitions, 3372 flow [2025-03-08 21:58:08,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:08,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:08,272 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] [2025-03-08 21:58:08,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 21:58:08,273 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:08,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:08,273 INFO L85 PathProgramCache]: Analyzing trace with hash -254220260, now seen corresponding path program 6 times [2025-03-08 21:58:08,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:08,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710000737] [2025-03-08 21:58:08,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:08,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:08,281 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:08,285 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:08,285 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:08,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:08,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:08,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710000737] [2025-03-08 21:58:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710000737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757056207] [2025-03-08 21:58:08,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:08,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:08,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:08,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:09,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:09,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 371 transitions, 3372 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:09,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:09,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:09,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:09,770 INFO L124 PetriNetUnfolderBase]: 1367/4801 cut-off events. [2025-03-08 21:58:09,770 INFO L125 PetriNetUnfolderBase]: For 15445/15671 co-relation queries the response was YES. [2025-03-08 21:58:09,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17278 conditions, 4801 events. 1367/4801 cut-off events. For 15445/15671 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 46022 event pairs, 58 based on Foata normal form. 35/4818 useless extension candidates. Maximal degree in co-relation 17213. Up to 874 conditions per place. [2025-03-08 21:58:09,795 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 66 selfloop transitions, 26 changer transitions 8/386 dead transitions. [2025-03-08 21:58:09,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 386 transitions, 3618 flow [2025-03-08 21:58:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1127 transitions. [2025-03-08 21:58:09,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781011781011781 [2025-03-08 21:58:09,796 INFO L175 Difference]: Start difference. First operand has 255 places, 371 transitions, 3372 flow. Second operand 13 states and 1127 transitions. [2025-03-08 21:58:09,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 386 transitions, 3618 flow [2025-03-08 21:58:09,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 386 transitions, 3523 flow, removed 10 selfloop flow, removed 15 redundant places. [2025-03-08 21:58:09,870 INFO L231 Difference]: Finished difference. Result has 245 places, 365 transitions, 3246 flow [2025-03-08 21:58:09,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3246, PETRI_PLACES=245, PETRI_TRANSITIONS=365} [2025-03-08 21:58:09,870 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 131 predicate places. [2025-03-08 21:58:09,870 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 365 transitions, 3246 flow [2025-03-08 21:58:09,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:09,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:09,871 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] [2025-03-08 21:58:09,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 21:58:09,871 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:09,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:09,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1405176266, now seen corresponding path program 7 times [2025-03-08 21:58:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075566327] [2025-03-08 21:58:09,872 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:09,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:09,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:58:09,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:09,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:09,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:10,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:10,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:10,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075566327] [2025-03-08 21:58:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075566327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:10,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057317428] [2025-03-08 21:58:10,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:10,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:10,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:10,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:10,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:10,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:10,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 365 transitions, 3246 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:10,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:10,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:10,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:11,054 INFO L124 PetriNetUnfolderBase]: 1367/4818 cut-off events. [2025-03-08 21:58:11,054 INFO L125 PetriNetUnfolderBase]: For 14506/14745 co-relation queries the response was YES. [2025-03-08 21:58:11,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17132 conditions, 4818 events. 1367/4818 cut-off events. For 14506/14745 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 46155 event pairs, 60 based on Foata normal form. 35/4835 useless extension candidates. Maximal degree in co-relation 17069. Up to 861 conditions per place. [2025-03-08 21:58:11,089 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 63 selfloop transitions, 28 changer transitions 4/381 dead transitions. [2025-03-08 21:58:11,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 381 transitions, 3548 flow [2025-03-08 21:58:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1131 transitions. [2025-03-08 21:58:11,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7837837837837838 [2025-03-08 21:58:11,090 INFO L175 Difference]: Start difference. First operand has 245 places, 365 transitions, 3246 flow. Second operand 13 states and 1131 transitions. [2025-03-08 21:58:11,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 381 transitions, 3548 flow [2025-03-08 21:58:11,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 381 transitions, 3434 flow, removed 17 selfloop flow, removed 16 redundant places. [2025-03-08 21:58:11,209 INFO L231 Difference]: Finished difference. Result has 239 places, 365 transitions, 3223 flow [2025-03-08 21:58:11,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3153, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3223, PETRI_PLACES=239, PETRI_TRANSITIONS=365} [2025-03-08 21:58:11,209 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 125 predicate places. [2025-03-08 21:58:11,209 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 365 transitions, 3223 flow [2025-03-08 21:58:11,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:11,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:11,210 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] [2025-03-08 21:58:11,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 21:58:11,210 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:11,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:11,211 INFO L85 PathProgramCache]: Analyzing trace with hash -764877314, now seen corresponding path program 8 times [2025-03-08 21:58:11,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:11,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363585345] [2025-03-08 21:58:11,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:11,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:11,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:11,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:11,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:11,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:11,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:11,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363585345] [2025-03-08 21:58:11,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363585345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:11,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582677342] [2025-03-08 21:58:11,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:11,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:11,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:11,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:11,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:11,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:11,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 365 transitions, 3223 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:11,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:11,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:11,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:12,595 INFO L124 PetriNetUnfolderBase]: 1365/4791 cut-off events. [2025-03-08 21:58:12,595 INFO L125 PetriNetUnfolderBase]: For 14140/14363 co-relation queries the response was YES. [2025-03-08 21:58:12,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16979 conditions, 4791 events. 1365/4791 cut-off events. For 14140/14363 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 45920 event pairs, 61 based on Foata normal form. 34/4807 useless extension candidates. Maximal degree in co-relation 16919. Up to 864 conditions per place. [2025-03-08 21:58:12,618 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 60 selfloop transitions, 30 changer transitions 5/381 dead transitions. [2025-03-08 21:58:12,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 381 transitions, 3522 flow [2025-03-08 21:58:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1130 transitions. [2025-03-08 21:58:12,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7830907830907831 [2025-03-08 21:58:12,619 INFO L175 Difference]: Start difference. First operand has 239 places, 365 transitions, 3223 flow. Second operand 13 states and 1130 transitions. [2025-03-08 21:58:12,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 381 transitions, 3522 flow [2025-03-08 21:58:12,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 381 transitions, 3452 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-03-08 21:58:12,680 INFO L231 Difference]: Finished difference. Result has 242 places, 366 transitions, 3255 flow [2025-03-08 21:58:12,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3163, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3255, PETRI_PLACES=242, PETRI_TRANSITIONS=366} [2025-03-08 21:58:12,680 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 128 predicate places. [2025-03-08 21:58:12,680 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 366 transitions, 3255 flow [2025-03-08 21:58:12,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:12,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:12,681 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] [2025-03-08 21:58:12,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 21:58:12,681 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:12,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1927979198, now seen corresponding path program 9 times [2025-03-08 21:58:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:12,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293911126] [2025-03-08 21:58:12,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:12,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:12,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:12,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:12,690 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:12,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293911126] [2025-03-08 21:58:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293911126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476218980] [2025-03-08 21:58:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:12,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:12,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:12,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:13,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:13,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 366 transitions, 3255 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:13,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:13,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:13,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:13,926 INFO L124 PetriNetUnfolderBase]: 1096/3975 cut-off events. [2025-03-08 21:58:13,926 INFO L125 PetriNetUnfolderBase]: For 11457/11638 co-relation queries the response was YES. [2025-03-08 21:58:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13981 conditions, 3975 events. 1096/3975 cut-off events. For 11457/11638 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 36502 event pairs, 50 based on Foata normal form. 28/3989 useless extension candidates. Maximal degree in co-relation 13918. Up to 700 conditions per place. [2025-03-08 21:58:13,945 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 55 selfloop transitions, 21 changer transitions 12/374 dead transitions. [2025-03-08 21:58:13,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 374 transitions, 3435 flow [2025-03-08 21:58:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1126 transitions. [2025-03-08 21:58:13,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7803187803187803 [2025-03-08 21:58:13,946 INFO L175 Difference]: Start difference. First operand has 242 places, 366 transitions, 3255 flow. Second operand 13 states and 1126 transitions. [2025-03-08 21:58:13,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 374 transitions, 3435 flow [2025-03-08 21:58:13,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 374 transitions, 3374 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-03-08 21:58:14,001 INFO L231 Difference]: Finished difference. Result has 243 places, 355 transitions, 3100 flow [2025-03-08 21:58:14,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3128, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3100, PETRI_PLACES=243, PETRI_TRANSITIONS=355} [2025-03-08 21:58:14,002 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 129 predicate places. [2025-03-08 21:58:14,002 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 355 transitions, 3100 flow [2025-03-08 21:58:14,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:14,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:14,002 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] [2025-03-08 21:58:14,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 21:58:14,002 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:14,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:14,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1240706426, now seen corresponding path program 10 times [2025-03-08 21:58:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:14,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335026920] [2025-03-08 21:58:14,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:14,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:14,015 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:14,015 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:14,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:14,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:14,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335026920] [2025-03-08 21:58:14,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335026920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:14,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:14,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:58:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938336064] [2025-03-08 21:58:14,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:14,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:58:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:14,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:58:14,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:58:14,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-03-08 21:58:14,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 355 transitions, 3100 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:14,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:14,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-03-08 21:58:14,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:16,004 INFO L124 PetriNetUnfolderBase]: 1914/5762 cut-off events. [2025-03-08 21:58:16,004 INFO L125 PetriNetUnfolderBase]: For 23910/24378 co-relation queries the response was YES. [2025-03-08 21:58:16,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23117 conditions, 5762 events. 1914/5762 cut-off events. For 23910/24378 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 53266 event pairs, 145 based on Foata normal form. 111/5839 useless extension candidates. Maximal degree in co-relation 23055. Up to 1232 conditions per place. [2025-03-08 21:58:16,047 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 493 selfloop transitions, 138 changer transitions 39/795 dead transitions. [2025-03-08 21:58:16,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 795 transitions, 8309 flow [2025-03-08 21:58:16,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 21:58:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 21:58:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1576 transitions. [2025-03-08 21:58:16,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7472735893788526 [2025-03-08 21:58:16,048 INFO L175 Difference]: Start difference. First operand has 243 places, 355 transitions, 3100 flow. Second operand 19 states and 1576 transitions. [2025-03-08 21:58:16,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 795 transitions, 8309 flow [2025-03-08 21:58:16,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 795 transitions, 8104 flow, removed 32 selfloop flow, removed 19 redundant places. [2025-03-08 21:58:16,138 INFO L231 Difference]: Finished difference. Result has 245 places, 451 transitions, 4543 flow [2025-03-08 21:58:16,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3008, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4543, PETRI_PLACES=245, PETRI_TRANSITIONS=451} [2025-03-08 21:58:16,138 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 131 predicate places. [2025-03-08 21:58:16,139 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 451 transitions, 4543 flow [2025-03-08 21:58:16,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:16,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:16,139 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] [2025-03-08 21:58:16,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 21:58:16,139 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:16,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:16,140 INFO L85 PathProgramCache]: Analyzing trace with hash -143492506, now seen corresponding path program 11 times [2025-03-08 21:58:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469711685] [2025-03-08 21:58:16,140 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:16,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:16,146 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:16,148 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:16,149 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:16,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:16,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469711685] [2025-03-08 21:58:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469711685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969391342] [2025-03-08 21:58:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:16,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:16,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:16,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:16,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 451 transitions, 4543 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:16,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:16,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:16,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:17,264 INFO L124 PetriNetUnfolderBase]: 1419/4877 cut-off events. [2025-03-08 21:58:17,264 INFO L125 PetriNetUnfolderBase]: For 18570/18880 co-relation queries the response was YES. [2025-03-08 21:58:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18370 conditions, 4877 events. 1419/4877 cut-off events. For 18570/18880 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 46879 event pairs, 57 based on Foata normal form. 48/4909 useless extension candidates. Maximal degree in co-relation 18304. Up to 879 conditions per place. [2025-03-08 21:58:17,299 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 40 selfloop transitions, 63 changer transitions 4/467 dead transitions. [2025-03-08 21:58:17,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 467 transitions, 4846 flow [2025-03-08 21:58:17,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-03-08 21:58:17,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-03-08 21:58:17,300 INFO L175 Difference]: Start difference. First operand has 245 places, 451 transitions, 4543 flow. Second operand 13 states and 1122 transitions. [2025-03-08 21:58:17,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 467 transitions, 4846 flow [2025-03-08 21:58:17,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 467 transitions, 4782 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-03-08 21:58:17,395 INFO L231 Difference]: Finished difference. Result has 256 places, 449 transitions, 4612 flow [2025-03-08 21:58:17,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=4479, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4612, PETRI_PLACES=256, PETRI_TRANSITIONS=449} [2025-03-08 21:58:17,395 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 142 predicate places. [2025-03-08 21:58:17,396 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 449 transitions, 4612 flow [2025-03-08 21:58:17,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:17,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:17,396 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] [2025-03-08 21:58:17,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 21:58:17,396 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:17,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2145563958, now seen corresponding path program 12 times [2025-03-08 21:58:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411715815] [2025-03-08 21:58:17,397 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:17,406 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:17,409 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:17,409 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:17,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:17,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411715815] [2025-03-08 21:58:17,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411715815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:17,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:17,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:17,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509619550] [2025-03-08 21:58:17,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:17,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:17,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:17,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:18,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:18,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 449 transitions, 4612 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:18,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:18,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:18,755 INFO L124 PetriNetUnfolderBase]: 1688/5727 cut-off events. [2025-03-08 21:58:18,755 INFO L125 PetriNetUnfolderBase]: For 22620/22935 co-relation queries the response was YES. [2025-03-08 21:58:18,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21792 conditions, 5727 events. 1688/5727 cut-off events. For 22620/22935 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 57013 event pairs, 67 based on Foata normal form. 30/5738 useless extension candidates. Maximal degree in co-relation 21725. Up to 1041 conditions per place. [2025-03-08 21:58:18,794 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 75 selfloop transitions, 35 changer transitions 1/471 dead transitions. [2025-03-08 21:58:18,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 471 transitions, 5011 flow [2025-03-08 21:58:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1135 transitions. [2025-03-08 21:58:18,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865557865557865 [2025-03-08 21:58:18,796 INFO L175 Difference]: Start difference. First operand has 256 places, 449 transitions, 4612 flow. Second operand 13 states and 1135 transitions. [2025-03-08 21:58:18,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 471 transitions, 5011 flow [2025-03-08 21:58:18,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 471 transitions, 4898 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-08 21:58:18,899 INFO L231 Difference]: Finished difference. Result has 259 places, 455 transitions, 4674 flow [2025-03-08 21:58:18,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=4513, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4674, PETRI_PLACES=259, PETRI_TRANSITIONS=455} [2025-03-08 21:58:18,899 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 145 predicate places. [2025-03-08 21:58:18,899 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 455 transitions, 4674 flow [2025-03-08 21:58:18,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:18,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:18,900 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] [2025-03-08 21:58:18,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 21:58:18,900 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:18,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1870818112, now seen corresponding path program 13 times [2025-03-08 21:58:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:18,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165498052] [2025-03-08 21:58:18,901 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:18,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:18,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:58:18,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:18,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:18,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:19,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:19,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165498052] [2025-03-08 21:58:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165498052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873624638] [2025-03-08 21:58:19,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:19,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:19,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:19,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:19,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:19,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 455 transitions, 4674 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:19,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:19,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:19,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:20,127 INFO L124 PetriNetUnfolderBase]: 1417/4881 cut-off events. [2025-03-08 21:58:20,127 INFO L125 PetriNetUnfolderBase]: For 19299/19560 co-relation queries the response was YES. [2025-03-08 21:58:20,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18619 conditions, 4881 events. 1417/4881 cut-off events. For 19299/19560 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 46855 event pairs, 59 based on Foata normal form. 29/4893 useless extension candidates. Maximal degree in co-relation 18549. Up to 879 conditions per place. [2025-03-08 21:58:20,165 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 60 selfloop transitions, 43 changer transitions 3/464 dead transitions. [2025-03-08 21:58:20,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 464 transitions, 4864 flow [2025-03-08 21:58:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1125 transitions. [2025-03-08 21:58:20,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7796257796257796 [2025-03-08 21:58:20,166 INFO L175 Difference]: Start difference. First operand has 259 places, 455 transitions, 4674 flow. Second operand 13 states and 1125 transitions. [2025-03-08 21:58:20,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 464 transitions, 4864 flow [2025-03-08 21:58:20,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 464 transitions, 4780 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-03-08 21:58:20,259 INFO L231 Difference]: Finished difference. Result has 263 places, 447 transitions, 4583 flow [2025-03-08 21:58:20,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=4480, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4583, PETRI_PLACES=263, PETRI_TRANSITIONS=447} [2025-03-08 21:58:20,259 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 149 predicate places. [2025-03-08 21:58:20,260 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 447 transitions, 4583 flow [2025-03-08 21:58:20,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:20,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:20,260 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] [2025-03-08 21:58:20,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 21:58:20,260 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:20,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash -159240870, now seen corresponding path program 14 times [2025-03-08 21:58:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:20,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304738682] [2025-03-08 21:58:20,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:20,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:20,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:20,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:20,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:20,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:20,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304738682] [2025-03-08 21:58:20,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304738682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:20,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:20,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900764963] [2025-03-08 21:58:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:20,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:20,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:20,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:20,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:20,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:20,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 447 transitions, 4583 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:20,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:20,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:20,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:21,458 INFO L124 PetriNetUnfolderBase]: 1105/3916 cut-off events. [2025-03-08 21:58:21,459 INFO L125 PetriNetUnfolderBase]: For 15294/15512 co-relation queries the response was YES. [2025-03-08 21:58:21,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14721 conditions, 3916 events. 1105/3916 cut-off events. For 15294/15512 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 35768 event pairs, 50 based on Foata normal form. 25/3926 useless extension candidates. Maximal degree in co-relation 14650. Up to 693 conditions per place. [2025-03-08 21:58:21,487 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 47 selfloop transitions, 40 changer transitions 6/387 dead transitions. [2025-03-08 21:58:21,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 387 transitions, 3804 flow [2025-03-08 21:58:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-03-08 21:58:21,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-03-08 21:58:21,488 INFO L175 Difference]: Start difference. First operand has 263 places, 447 transitions, 4583 flow. Second operand 13 states and 1122 transitions. [2025-03-08 21:58:21,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 387 transitions, 3804 flow [2025-03-08 21:58:21,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 387 transitions, 3635 flow, removed 41 selfloop flow, removed 20 redundant places. [2025-03-08 21:58:21,558 INFO L231 Difference]: Finished difference. Result has 248 places, 367 transitions, 3405 flow [2025-03-08 21:58:21,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3390, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3405, PETRI_PLACES=248, PETRI_TRANSITIONS=367} [2025-03-08 21:58:21,559 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 134 predicate places. [2025-03-08 21:58:21,559 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 367 transitions, 3405 flow [2025-03-08 21:58:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:21,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:21,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 21:58:21,560 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:21,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1254933028, now seen corresponding path program 15 times [2025-03-08 21:58:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956209950] [2025-03-08 21:58:21,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:21,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:21,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:21,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:21,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:21,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956209950] [2025-03-08 21:58:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956209950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:21,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187008757] [2025-03-08 21:58:21,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:21,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:21,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:21,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:22,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:22,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 367 transitions, 3405 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:22,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:22,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:22,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:22,590 INFO L124 PetriNetUnfolderBase]: 831/3035 cut-off events. [2025-03-08 21:58:22,590 INFO L125 PetriNetUnfolderBase]: For 10420/10576 co-relation queries the response was YES. [2025-03-08 21:58:22,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10890 conditions, 3035 events. 831/3035 cut-off events. For 10420/10576 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 26191 event pairs, 39 based on Foata normal form. 14/3038 useless extension candidates. Maximal degree in co-relation 10829. Up to 524 conditions per place. [2025-03-08 21:58:22,608 INFO L140 encePairwiseOnDemand]: 94/111 looper letters, 45 selfloop transitions, 21 changer transitions 15/307 dead transitions. [2025-03-08 21:58:22,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 307 transitions, 2580 flow [2025-03-08 21:58:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2025-03-08 21:58:22,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726957726957727 [2025-03-08 21:58:22,609 INFO L175 Difference]: Start difference. First operand has 248 places, 367 transitions, 3405 flow. Second operand 13 states and 1115 transitions. [2025-03-08 21:58:22,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 307 transitions, 2580 flow [2025-03-08 21:58:22,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 307 transitions, 2408 flow, removed 49 selfloop flow, removed 26 redundant places. [2025-03-08 21:58:22,647 INFO L231 Difference]: Finished difference. Result has 220 places, 279 transitions, 2104 flow [2025-03-08 21:58:22,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2195, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2104, PETRI_PLACES=220, PETRI_TRANSITIONS=279} [2025-03-08 21:58:22,648 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 106 predicate places. [2025-03-08 21:58:22,648 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 279 transitions, 2104 flow [2025-03-08 21:58:22,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:22,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:22,648 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] [2025-03-08 21:58:22,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 21:58:22,648 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:22,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1399763320, now seen corresponding path program 16 times [2025-03-08 21:58:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:22,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107370663] [2025-03-08 21:58:22,649 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:22,655 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:22,659 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:22,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:22,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:22,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:22,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107370663] [2025-03-08 21:58:22,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107370663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:22,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:22,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183677454] [2025-03-08 21:58:22,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:22,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:22,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:22,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:22,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:23,224 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:23,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 279 transitions, 2104 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:23,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:23,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:23,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:23,578 INFO L124 PetriNetUnfolderBase]: 825/2997 cut-off events. [2025-03-08 21:58:23,578 INFO L125 PetriNetUnfolderBase]: For 8700/8864 co-relation queries the response was YES. [2025-03-08 21:58:23,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10274 conditions, 2997 events. 825/2997 cut-off events. For 8700/8864 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25851 event pairs, 40 based on Foata normal form. 17/3003 useless extension candidates. Maximal degree in co-relation 10227. Up to 527 conditions per place. [2025-03-08 21:58:23,593 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 39 selfloop transitions, 25 changer transitions 5/295 dead transitions. [2025-03-08 21:58:23,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 295 transitions, 2338 flow [2025-03-08 21:58:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:23,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-03-08 21:58:23,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-03-08 21:58:23,594 INFO L175 Difference]: Start difference. First operand has 220 places, 279 transitions, 2104 flow. Second operand 13 states and 1123 transitions. [2025-03-08 21:58:23,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 295 transitions, 2338 flow [2025-03-08 21:58:23,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 295 transitions, 2250 flow, removed 4 selfloop flow, removed 14 redundant places. [2025-03-08 21:58:23,621 INFO L231 Difference]: Finished difference. Result has 207 places, 279 transitions, 2091 flow [2025-03-08 21:58:23,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2091, PETRI_PLACES=207, PETRI_TRANSITIONS=279} [2025-03-08 21:58:23,621 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 93 predicate places. [2025-03-08 21:58:23,621 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 279 transitions, 2091 flow [2025-03-08 21:58:23,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:23,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:23,622 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] [2025-03-08 21:58:23,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 21:58:23,622 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash 162071462, now seen corresponding path program 17 times [2025-03-08 21:58:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:23,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271707809] [2025-03-08 21:58:23,623 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:23,629 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:23,632 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:23,632 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:23,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271707809] [2025-03-08 21:58:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271707809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746238101] [2025-03-08 21:58:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:23,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:23,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:23,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:24,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:24,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 279 transitions, 2091 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:24,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:24,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:24,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:24,544 INFO L124 PetriNetUnfolderBase]: 555/2151 cut-off events. [2025-03-08 21:58:24,544 INFO L125 PetriNetUnfolderBase]: For 5617/5734 co-relation queries the response was YES. [2025-03-08 21:58:24,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7250 conditions, 2151 events. 555/2151 cut-off events. For 5617/5734 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 16973 event pairs, 27 based on Foata normal form. 10/2154 useless extension candidates. Maximal degree in co-relation 7206. Up to 358 conditions per place. [2025-03-08 21:58:24,553 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 36 selfloop transitions, 20 changer transitions 7/289 dead transitions. [2025-03-08 21:58:24,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 289 transitions, 2242 flow [2025-03-08 21:58:24,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1124 transitions. [2025-03-08 21:58:24,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7789327789327789 [2025-03-08 21:58:24,555 INFO L175 Difference]: Start difference. First operand has 207 places, 279 transitions, 2091 flow. Second operand 13 states and 1124 transitions. [2025-03-08 21:58:24,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 289 transitions, 2242 flow [2025-03-08 21:58:24,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 289 transitions, 2178 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-03-08 21:58:24,575 INFO L231 Difference]: Finished difference. Result has 209 places, 273 transitions, 2004 flow [2025-03-08 21:58:24,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1977, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2004, PETRI_PLACES=209, PETRI_TRANSITIONS=273} [2025-03-08 21:58:24,575 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 95 predicate places. [2025-03-08 21:58:24,576 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 273 transitions, 2004 flow [2025-03-08 21:58:24,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:24,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:24,576 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] [2025-03-08 21:58:24,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 21:58:24,576 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2014051008, now seen corresponding path program 18 times [2025-03-08 21:58:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875365928] [2025-03-08 21:58:24,577 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:24,583 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:24,587 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:24,587 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:24,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:24,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:24,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875365928] [2025-03-08 21:58:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875365928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:24,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:24,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:24,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809286922] [2025-03-08 21:58:24,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:24,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:24,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:24,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:25,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:25,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 273 transitions, 2004 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:25,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:25,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:25,524 INFO L124 PetriNetUnfolderBase]: 554/2105 cut-off events. [2025-03-08 21:58:25,524 INFO L125 PetriNetUnfolderBase]: For 5290/5391 co-relation queries the response was YES. [2025-03-08 21:58:25,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 2105 events. 554/2105 cut-off events. For 5290/5391 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16513 event pairs, 26 based on Foata normal form. 14/2113 useless extension candidates. Maximal degree in co-relation 6999. Up to 348 conditions per place. [2025-03-08 21:58:25,534 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 32 selfloop transitions, 25 changer transitions 4/287 dead transitions. [2025-03-08 21:58:25,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 287 transitions, 2219 flow [2025-03-08 21:58:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1121 transitions. [2025-03-08 21:58:25,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7768537768537769 [2025-03-08 21:58:25,535 INFO L175 Difference]: Start difference. First operand has 209 places, 273 transitions, 2004 flow. Second operand 13 states and 1121 transitions. [2025-03-08 21:58:25,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 287 transitions, 2219 flow [2025-03-08 21:58:25,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 287 transitions, 2141 flow, removed 14 selfloop flow, removed 16 redundant places. [2025-03-08 21:58:25,554 INFO L231 Difference]: Finished difference. Result has 202 places, 273 transitions, 2003 flow [2025-03-08 21:58:25,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2003, PETRI_PLACES=202, PETRI_TRANSITIONS=273} [2025-03-08 21:58:25,554 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 88 predicate places. [2025-03-08 21:58:25,554 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 273 transitions, 2003 flow [2025-03-08 21:58:25,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:25,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:25,555 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] [2025-03-08 21:58:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 21:58:25,555 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:25,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:25,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2104851088, now seen corresponding path program 19 times [2025-03-08 21:58:25,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:25,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504104365] [2025-03-08 21:58:25,555 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:25,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:58:25,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:25,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:25,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:25,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504104365] [2025-03-08 21:58:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504104365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:25,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:25,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171072014] [2025-03-08 21:58:25,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:25,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:25,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:25,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:26,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:26,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 273 transitions, 2003 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:26,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:26,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:26,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:26,318 INFO L124 PetriNetUnfolderBase]: 281/1215 cut-off events. [2025-03-08 21:58:26,319 INFO L125 PetriNetUnfolderBase]: For 2668/2728 co-relation queries the response was YES. [2025-03-08 21:58:26,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 1215 events. 281/1215 cut-off events. For 2668/2728 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8055 event pairs, 13 based on Foata normal form. 8/1221 useless extension candidates. Maximal degree in co-relation 3858. Up to 185 conditions per place. [2025-03-08 21:58:26,323 INFO L140 encePairwiseOnDemand]: 94/111 looper letters, 27 selfloop transitions, 13 changer transitions 11/277 dead transitions. [2025-03-08 21:58:26,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 277 transitions, 2081 flow [2025-03-08 21:58:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2025-03-08 21:58:26,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.772002772002772 [2025-03-08 21:58:26,324 INFO L175 Difference]: Start difference. First operand has 202 places, 273 transitions, 2003 flow. Second operand 13 states and 1114 transitions. [2025-03-08 21:58:26,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 277 transitions, 2081 flow [2025-03-08 21:58:26,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 277 transitions, 2033 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-03-08 21:58:26,336 INFO L231 Difference]: Finished difference. Result has 200 places, 258 transitions, 1844 flow [2025-03-08 21:58:26,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1844, PETRI_PLACES=200, PETRI_TRANSITIONS=258} [2025-03-08 21:58:26,336 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 86 predicate places. [2025-03-08 21:58:26,336 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 258 transitions, 1844 flow [2025-03-08 21:58:26,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:26,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:26,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:26,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 21:58:26,337 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 621630642, now seen corresponding path program 20 times [2025-03-08 21:58:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12824607] [2025-03-08 21:58:26,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:26,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:26,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:26,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:26,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:26,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:26,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12824607] [2025-03-08 21:58:26,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12824607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:26,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:26,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:26,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198134999] [2025-03-08 21:58:26,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:26,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:26,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:26,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:27,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:27,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 258 transitions, 1844 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:27,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:27,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:27,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:27,258 INFO L124 PetriNetUnfolderBase]: 284/1258 cut-off events. [2025-03-08 21:58:27,259 INFO L125 PetriNetUnfolderBase]: For 2677/2720 co-relation queries the response was YES. [2025-03-08 21:58:27,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4003 conditions, 1258 events. 284/1258 cut-off events. For 2677/2720 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8630 event pairs, 18 based on Foata normal form. 9/1265 useless extension candidates. Maximal degree in co-relation 3963. Up to 210 conditions per place. [2025-03-08 21:58:27,265 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 29 selfloop transitions, 15 changer transitions 19/287 dead transitions. [2025-03-08 21:58:27,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 287 transitions, 2179 flow [2025-03-08 21:58:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-03-08 21:58:27,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-03-08 21:58:27,266 INFO L175 Difference]: Start difference. First operand has 200 places, 258 transitions, 1844 flow. Second operand 13 states and 1123 transitions. [2025-03-08 21:58:27,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 287 transitions, 2179 flow [2025-03-08 21:58:27,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 287 transitions, 1982 flow, removed 4 selfloop flow, removed 18 redundant places. [2025-03-08 21:58:27,280 INFO L231 Difference]: Finished difference. Result has 185 places, 255 transitions, 1777 flow [2025-03-08 21:58:27,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1777, PETRI_PLACES=185, PETRI_TRANSITIONS=255} [2025-03-08 21:58:27,280 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 71 predicate places. [2025-03-08 21:58:27,281 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 255 transitions, 1777 flow [2025-03-08 21:58:27,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:27,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:27,281 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] [2025-03-08 21:58:27,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 21:58:27,281 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:27,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 959938304, now seen corresponding path program 21 times [2025-03-08 21:58:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588852216] [2025-03-08 21:58:27,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:27,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:27,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:27,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:27,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:27,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588852216] [2025-03-08 21:58:27,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588852216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:27,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:27,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692169245] [2025-03-08 21:58:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:27,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:27,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:27,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:27,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:27,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:27,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 255 transitions, 1777 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:27,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:27,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:28,249 INFO L124 PetriNetUnfolderBase]: 527/1966 cut-off events. [2025-03-08 21:58:28,250 INFO L125 PetriNetUnfolderBase]: For 3869/3970 co-relation queries the response was YES. [2025-03-08 21:58:28,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6236 conditions, 1966 events. 527/1966 cut-off events. For 3869/3970 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 15096 event pairs, 21 based on Foata normal form. 11/1972 useless extension candidates. Maximal degree in co-relation 6198. Up to 341 conditions per place. [2025-03-08 21:58:28,258 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 28 selfloop transitions, 22 changer transitions 2/276 dead transitions. [2025-03-08 21:58:28,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 276 transitions, 1978 flow [2025-03-08 21:58:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1117 transitions. [2025-03-08 21:58:28,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.774081774081774 [2025-03-08 21:58:28,259 INFO L175 Difference]: Start difference. First operand has 185 places, 255 transitions, 1777 flow. Second operand 13 states and 1117 transitions. [2025-03-08 21:58:28,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 276 transitions, 1978 flow [2025-03-08 21:58:28,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 276 transitions, 1912 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-03-08 21:58:28,275 INFO L231 Difference]: Finished difference. Result has 185 places, 261 transitions, 1837 flow [2025-03-08 21:58:28,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1837, PETRI_PLACES=185, PETRI_TRANSITIONS=261} [2025-03-08 21:58:28,276 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 71 predicate places. [2025-03-08 21:58:28,276 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 261 transitions, 1837 flow [2025-03-08 21:58:28,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:28,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:28,276 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] [2025-03-08 21:58:28,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 21:58:28,276 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:28,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2090230595, now seen corresponding path program 10 times [2025-03-08 21:58:28,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:28,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913735253] [2025-03-08 21:58:28,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:28,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:28,282 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:28,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:28,287 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:28,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:28,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:28,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913735253] [2025-03-08 21:58:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913735253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:28,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:28,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914016981] [2025-03-08 21:58:28,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:28,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:28,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:28,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:28,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:28,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 261 transitions, 1837 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:28,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:28,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:28,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:29,274 INFO L124 PetriNetUnfolderBase]: 800/2898 cut-off events. [2025-03-08 21:58:29,274 INFO L125 PetriNetUnfolderBase]: For 6179/6307 co-relation queries the response was YES. [2025-03-08 21:58:29,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 2898 events. 800/2898 cut-off events. For 6179/6307 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 24832 event pairs, 36 based on Foata normal form. 16/2908 useless extension candidates. Maximal degree in co-relation 9397. Up to 536 conditions per place. [2025-03-08 21:58:29,290 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 39 selfloop transitions, 20 changer transitions 7/290 dead transitions. [2025-03-08 21:58:29,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 290 transitions, 2133 flow [2025-03-08 21:58:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1121 transitions. [2025-03-08 21:58:29,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7768537768537769 [2025-03-08 21:58:29,291 INFO L175 Difference]: Start difference. First operand has 185 places, 261 transitions, 1837 flow. Second operand 13 states and 1121 transitions. [2025-03-08 21:58:29,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 290 transitions, 2133 flow [2025-03-08 21:58:29,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 290 transitions, 2076 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-03-08 21:58:29,314 INFO L231 Difference]: Finished difference. Result has 192 places, 267 transitions, 1914 flow [2025-03-08 21:58:29,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1914, PETRI_PLACES=192, PETRI_TRANSITIONS=267} [2025-03-08 21:58:29,315 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 78 predicate places. [2025-03-08 21:58:29,315 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 267 transitions, 1914 flow [2025-03-08 21:58:29,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:29,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:29,315 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] [2025-03-08 21:58:29,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 21:58:29,315 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:29,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:29,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1851275793, now seen corresponding path program 11 times [2025-03-08 21:58:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088432465] [2025-03-08 21:58:29,316 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:29,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:29,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:29,325 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:29,325 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:29,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088432465] [2025-03-08 21:58:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088432465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:29,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:29,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053501795] [2025-03-08 21:58:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:29,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:29,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:29,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:29,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:29,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 267 transitions, 1914 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:29,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:29,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:29,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:30,308 INFO L124 PetriNetUnfolderBase]: 1066/3727 cut-off events. [2025-03-08 21:58:30,308 INFO L125 PetriNetUnfolderBase]: For 8830/9056 co-relation queries the response was YES. [2025-03-08 21:58:30,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12382 conditions, 3727 events. 1066/3727 cut-off events. For 8830/9056 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 33725 event pairs, 44 based on Foata normal form. 18/3736 useless extension candidates. Maximal degree in co-relation 12340. Up to 687 conditions per place. [2025-03-08 21:58:30,326 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 35 selfloop transitions, 27 changer transitions 3/289 dead transitions. [2025-03-08 21:58:30,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 289 transitions, 2193 flow [2025-03-08 21:58:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1121 transitions. [2025-03-08 21:58:30,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7768537768537769 [2025-03-08 21:58:30,327 INFO L175 Difference]: Start difference. First operand has 192 places, 267 transitions, 1914 flow. Second operand 13 states and 1121 transitions. [2025-03-08 21:58:30,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 289 transitions, 2193 flow [2025-03-08 21:58:30,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 289 transitions, 2141 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-08 21:58:30,357 INFO L231 Difference]: Finished difference. Result has 198 places, 275 transitions, 2029 flow [2025-03-08 21:58:30,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2029, PETRI_PLACES=198, PETRI_TRANSITIONS=275} [2025-03-08 21:58:30,358 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 84 predicate places. [2025-03-08 21:58:30,358 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 275 transitions, 2029 flow [2025-03-08 21:58:30,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:30,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:30,358 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] [2025-03-08 21:58:30,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 21:58:30,358 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:30,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash 139479201, now seen corresponding path program 12 times [2025-03-08 21:58:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:30,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945126921] [2025-03-08 21:58:30,359 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:30,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:30,364 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:30,367 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:30,367 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:30,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:30,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945126921] [2025-03-08 21:58:30,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945126921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:30,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:30,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:30,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669182833] [2025-03-08 21:58:30,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:30,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:30,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:30,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:31,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:31,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 275 transitions, 2029 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:31,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:31,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:31,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:31,532 INFO L124 PetriNetUnfolderBase]: 1341/4672 cut-off events. [2025-03-08 21:58:31,532 INFO L125 PetriNetUnfolderBase]: For 12021/12302 co-relation queries the response was YES. [2025-03-08 21:58:31,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15860 conditions, 4672 events. 1341/4672 cut-off events. For 12021/12302 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 44380 event pairs, 66 based on Foata normal form. 23/4684 useless extension candidates. Maximal degree in co-relation 15815. Up to 865 conditions per place. [2025-03-08 21:58:31,559 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 50 selfloop transitions, 25 changer transitions 6/305 dead transitions. [2025-03-08 21:58:31,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 305 transitions, 2414 flow [2025-03-08 21:58:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1127 transitions. [2025-03-08 21:58:31,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.781011781011781 [2025-03-08 21:58:31,561 INFO L175 Difference]: Start difference. First operand has 198 places, 275 transitions, 2029 flow. Second operand 13 states and 1127 transitions. [2025-03-08 21:58:31,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 305 transitions, 2414 flow [2025-03-08 21:58:31,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 305 transitions, 2357 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:31,602 INFO L231 Difference]: Finished difference. Result has 207 places, 282 transitions, 2141 flow [2025-03-08 21:58:31,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2141, PETRI_PLACES=207, PETRI_TRANSITIONS=282} [2025-03-08 21:58:31,603 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 93 predicate places. [2025-03-08 21:58:31,603 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 282 transitions, 2141 flow [2025-03-08 21:58:31,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:31,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:31,603 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] [2025-03-08 21:58:31,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 21:58:31,603 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1530199231, now seen corresponding path program 13 times [2025-03-08 21:58:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96098558] [2025-03-08 21:58:31,604 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:31,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:58:31,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:31,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:31,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96098558] [2025-03-08 21:58:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96098558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:31,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937985822] [2025-03-08 21:58:31,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:31,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:31,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:31,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:32,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:32,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 282 transitions, 2141 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:32,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:32,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:32,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:32,653 INFO L124 PetriNetUnfolderBase]: 1339/4696 cut-off events. [2025-03-08 21:58:32,653 INFO L125 PetriNetUnfolderBase]: For 12641/12891 co-relation queries the response was YES. [2025-03-08 21:58:32,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16095 conditions, 4696 events. 1339/4696 cut-off events. For 12641/12891 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 44774 event pairs, 58 based on Foata normal form. 30/4716 useless extension candidates. Maximal degree in co-relation 16045. Up to 883 conditions per place. [2025-03-08 21:58:32,683 INFO L140 encePairwiseOnDemand]: 91/111 looper letters, 47 selfloop transitions, 29 changer transitions 10/308 dead transitions. [2025-03-08 21:58:32,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 308 transitions, 2517 flow [2025-03-08 21:58:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1120 transitions. [2025-03-08 21:58:32,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7761607761607762 [2025-03-08 21:58:32,684 INFO L175 Difference]: Start difference. First operand has 207 places, 282 transitions, 2141 flow. Second operand 13 states and 1120 transitions. [2025-03-08 21:58:32,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 308 transitions, 2517 flow [2025-03-08 21:58:32,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 308 transitions, 2446 flow, removed 22 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:32,728 INFO L231 Difference]: Finished difference. Result has 214 places, 281 transitions, 2175 flow [2025-03-08 21:58:32,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2175, PETRI_PLACES=214, PETRI_TRANSITIONS=281} [2025-03-08 21:58:32,729 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 100 predicate places. [2025-03-08 21:58:32,729 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 281 transitions, 2175 flow [2025-03-08 21:58:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:32,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:32,729 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:32,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 21:58:32,729 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:32,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash 955716775, now seen corresponding path program 14 times [2025-03-08 21:58:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732427344] [2025-03-08 21:58:32,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:32,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:32,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:32,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:32,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:32,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:32,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732427344] [2025-03-08 21:58:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732427344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:32,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526362266] [2025-03-08 21:58:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:32,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:32,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:32,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:33,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:33,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 281 transitions, 2175 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:33,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:33,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:33,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:33,689 INFO L124 PetriNetUnfolderBase]: 1331/4559 cut-off events. [2025-03-08 21:58:33,689 INFO L125 PetriNetUnfolderBase]: For 13092/13364 co-relation queries the response was YES. [2025-03-08 21:58:33,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15830 conditions, 4559 events. 1331/4559 cut-off events. For 13092/13364 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 43116 event pairs, 60 based on Foata normal form. 21/4570 useless extension candidates. Maximal degree in co-relation 15777. Up to 837 conditions per place. [2025-03-08 21:58:33,718 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 43 selfloop transitions, 28 changer transitions 1/294 dead transitions. [2025-03-08 21:58:33,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 294 transitions, 2443 flow [2025-03-08 21:58:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:33,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-03-08 21:58:33,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-03-08 21:58:33,719 INFO L175 Difference]: Start difference. First operand has 214 places, 281 transitions, 2175 flow. Second operand 13 states and 1122 transitions. [2025-03-08 21:58:33,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 294 transitions, 2443 flow [2025-03-08 21:58:33,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 294 transitions, 2310 flow, removed 27 selfloop flow, removed 13 redundant places. [2025-03-08 21:58:33,764 INFO L231 Difference]: Finished difference. Result has 215 places, 286 transitions, 2205 flow [2025-03-08 21:58:33,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2205, PETRI_PLACES=215, PETRI_TRANSITIONS=286} [2025-03-08 21:58:33,764 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 101 predicate places. [2025-03-08 21:58:33,764 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 286 transitions, 2205 flow [2025-03-08 21:58:33,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:33,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:33,765 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] [2025-03-08 21:58:33,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 21:58:33,765 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:33,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2101967199, now seen corresponding path program 15 times [2025-03-08 21:58:33,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:33,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006120950] [2025-03-08 21:58:33,766 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:33,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:33,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:33,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:33,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:33,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006120950] [2025-03-08 21:58:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006120950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:33,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:33,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590759799] [2025-03-08 21:58:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:33,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:33,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:33,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:34,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:34,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 286 transitions, 2205 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:34,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:34,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:34,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:34,962 INFO L124 PetriNetUnfolderBase]: 1597/5433 cut-off events. [2025-03-08 21:58:34,963 INFO L125 PetriNetUnfolderBase]: For 15567/15844 co-relation queries the response was YES. [2025-03-08 21:58:34,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18781 conditions, 5433 events. 1597/5433 cut-off events. For 15567/15844 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 53456 event pairs, 71 based on Foata normal form. 21/5442 useless extension candidates. Maximal degree in co-relation 18728. Up to 1018 conditions per place. [2025-03-08 21:58:34,999 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 50 selfloop transitions, 28 changer transitions 5/305 dead transitions. [2025-03-08 21:58:34,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 305 transitions, 2561 flow [2025-03-08 21:58:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-03-08 21:58:35,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-03-08 21:58:35,001 INFO L175 Difference]: Start difference. First operand has 215 places, 286 transitions, 2205 flow. Second operand 13 states and 1123 transitions. [2025-03-08 21:58:35,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 305 transitions, 2561 flow [2025-03-08 21:58:35,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 305 transitions, 2461 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:35,056 INFO L231 Difference]: Finished difference. Result has 222 places, 292 transitions, 2291 flow [2025-03-08 21:58:35,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2291, PETRI_PLACES=222, PETRI_TRANSITIONS=292} [2025-03-08 21:58:35,056 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 108 predicate places. [2025-03-08 21:58:35,056 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 292 transitions, 2291 flow [2025-03-08 21:58:35,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:35,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:35,057 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] [2025-03-08 21:58:35,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 21:58:35,057 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:35,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1155783291, now seen corresponding path program 16 times [2025-03-08 21:58:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342426513] [2025-03-08 21:58:35,057 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:35,063 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:35,066 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:35,066 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:35,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342426513] [2025-03-08 21:58:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342426513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:35,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:35,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:58:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509035412] [2025-03-08 21:58:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:35,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:58:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:35,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:58:35,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:58:35,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-03-08 21:58:35,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 292 transitions, 2291 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:35,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:35,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-03-08 21:58:35,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:36,986 INFO L124 PetriNetUnfolderBase]: 2470/7497 cut-off events. [2025-03-08 21:58:36,986 INFO L125 PetriNetUnfolderBase]: For 31928/32597 co-relation queries the response was YES. [2025-03-08 21:58:37,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29963 conditions, 7497 events. 2470/7497 cut-off events. For 31928/32597 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 73754 event pairs, 313 based on Foata normal form. 153/7602 useless extension candidates. Maximal degree in co-relation 29907. Up to 1381 conditions per place. [2025-03-08 21:58:37,025 INFO L140 encePairwiseOnDemand]: 88/111 looper letters, 567 selfloop transitions, 137 changer transitions 30/826 dead transitions. [2025-03-08 21:58:37,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 826 transitions, 8775 flow [2025-03-08 21:58:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 21:58:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-08 21:58:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1652 transitions. [2025-03-08 21:58:37,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441441441441441 [2025-03-08 21:58:37,027 INFO L175 Difference]: Start difference. First operand has 222 places, 292 transitions, 2291 flow. Second operand 20 states and 1652 transitions. [2025-03-08 21:58:37,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 826 transitions, 8775 flow [2025-03-08 21:58:37,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 826 transitions, 8721 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-03-08 21:58:37,107 INFO L231 Difference]: Finished difference. Result has 241 places, 397 transitions, 4039 flow [2025-03-08 21:58:37,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4039, PETRI_PLACES=241, PETRI_TRANSITIONS=397} [2025-03-08 21:58:37,107 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 127 predicate places. [2025-03-08 21:58:37,107 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 397 transitions, 4039 flow [2025-03-08 21:58:37,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:37,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:37,108 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] [2025-03-08 21:58:37,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 21:58:37,108 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:37,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1847820493, now seen corresponding path program 17 times [2025-03-08 21:58:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:37,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660948664] [2025-03-08 21:58:37,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:37,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:37,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:37,119 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:37,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:37,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:37,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660948664] [2025-03-08 21:58:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660948664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:37,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357652548] [2025-03-08 21:58:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:37,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:37,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:37,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:37,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:37,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 397 transitions, 4039 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:37,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:37,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:37,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:38,753 INFO L124 PetriNetUnfolderBase]: 1637/5587 cut-off events. [2025-03-08 21:58:38,754 INFO L125 PetriNetUnfolderBase]: For 20402/20719 co-relation queries the response was YES. [2025-03-08 21:58:38,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20563 conditions, 5587 events. 1637/5587 cut-off events. For 20402/20719 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 55236 event pairs, 70 based on Foata normal form. 21/5595 useless extension candidates. Maximal degree in co-relation 20498. Up to 1047 conditions per place. [2025-03-08 21:58:38,802 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 56 selfloop transitions, 24 changer transitions 9/404 dead transitions. [2025-03-08 21:58:38,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 404 transitions, 4241 flow [2025-03-08 21:58:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1119 transitions. [2025-03-08 21:58:38,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7754677754677755 [2025-03-08 21:58:38,803 INFO L175 Difference]: Start difference. First operand has 241 places, 397 transitions, 4039 flow. Second operand 13 states and 1119 transitions. [2025-03-08 21:58:38,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 404 transitions, 4241 flow [2025-03-08 21:58:38,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 404 transitions, 4145 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-03-08 21:58:38,904 INFO L231 Difference]: Finished difference. Result has 248 places, 391 transitions, 3914 flow [2025-03-08 21:58:38,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3881, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3914, PETRI_PLACES=248, PETRI_TRANSITIONS=391} [2025-03-08 21:58:38,904 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 134 predicate places. [2025-03-08 21:58:38,904 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 391 transitions, 3914 flow [2025-03-08 21:58:38,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:38,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:38,905 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] [2025-03-08 21:58:38,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 21:58:38,905 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:38,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash 142085287, now seen corresponding path program 18 times [2025-03-08 21:58:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:38,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270210016] [2025-03-08 21:58:38,906 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:38,914 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:38,917 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:38,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:38,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270210016] [2025-03-08 21:58:39,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270210016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:39,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:39,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97275815] [2025-03-08 21:58:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:39,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:39,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:39,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:39,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:39,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 391 transitions, 3914 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:39,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:39,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:39,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:40,045 INFO L124 PetriNetUnfolderBase]: 1636/5529 cut-off events. [2025-03-08 21:58:40,045 INFO L125 PetriNetUnfolderBase]: For 19376/19676 co-relation queries the response was YES. [2025-03-08 21:58:40,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20109 conditions, 5529 events. 1636/5529 cut-off events. For 19376/19676 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 54512 event pairs, 70 based on Foata normal form. 29/5546 useless extension candidates. Maximal degree in co-relation 20043. Up to 1040 conditions per place. [2025-03-08 21:58:40,075 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 46 selfloop transitions, 35 changer transitions 5/399 dead transitions. [2025-03-08 21:58:40,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 399 transitions, 4174 flow [2025-03-08 21:58:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1122 transitions. [2025-03-08 21:58:40,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7775467775467776 [2025-03-08 21:58:40,076 INFO L175 Difference]: Start difference. First operand has 248 places, 391 transitions, 3914 flow. Second operand 13 states and 1122 transitions. [2025-03-08 21:58:40,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 399 transitions, 4174 flow [2025-03-08 21:58:40,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 399 transitions, 4084 flow, removed 16 selfloop flow, removed 15 redundant places. [2025-03-08 21:58:40,150 INFO L231 Difference]: Finished difference. Result has 244 places, 390 transitions, 3939 flow [2025-03-08 21:58:40,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3845, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3939, PETRI_PLACES=244, PETRI_TRANSITIONS=390} [2025-03-08 21:58:40,151 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 130 predicate places. [2025-03-08 21:58:40,151 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 390 transitions, 3939 flow [2025-03-08 21:58:40,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:40,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:40,155 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] [2025-03-08 21:58:40,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 21:58:40,155 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:40,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:40,155 INFO L85 PathProgramCache]: Analyzing trace with hash 2080706719, now seen corresponding path program 19 times [2025-03-08 21:58:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614418051] [2025-03-08 21:58:40,155 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:40,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:58:40,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:40,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:40,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:40,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:40,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614418051] [2025-03-08 21:58:40,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614418051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:40,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:40,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:40,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857254467] [2025-03-08 21:58:40,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:40,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:40,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:40,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:40,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:40,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 390 transitions, 3939 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:40,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:40,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:40,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:41,204 INFO L124 PetriNetUnfolderBase]: 1368/4716 cut-off events. [2025-03-08 21:58:41,205 INFO L125 PetriNetUnfolderBase]: For 16255/16514 co-relation queries the response was YES. [2025-03-08 21:58:41,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17192 conditions, 4716 events. 1368/4716 cut-off events. For 16255/16514 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 44861 event pairs, 60 based on Foata normal form. 17/4723 useless extension candidates. Maximal degree in co-relation 17127. Up to 875 conditions per place. [2025-03-08 21:58:41,237 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 46 selfloop transitions, 27 changer transitions 8/375 dead transitions. [2025-03-08 21:58:41,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 375 transitions, 3786 flow [2025-03-08 21:58:41,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1123 transitions. [2025-03-08 21:58:41,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7782397782397782 [2025-03-08 21:58:41,238 INFO L175 Difference]: Start difference. First operand has 244 places, 390 transitions, 3939 flow. Second operand 13 states and 1123 transitions. [2025-03-08 21:58:41,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 375 transitions, 3786 flow [2025-03-08 21:58:41,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 375 transitions, 3724 flow, removed 8 selfloop flow, removed 9 redundant places. [2025-03-08 21:58:41,300 INFO L231 Difference]: Finished difference. Result has 246 places, 365 transitions, 3523 flow [2025-03-08 21:58:41,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=3526, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3523, PETRI_PLACES=246, PETRI_TRANSITIONS=365} [2025-03-08 21:58:41,300 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 132 predicate places. [2025-03-08 21:58:41,300 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 365 transitions, 3523 flow [2025-03-08 21:58:41,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:41,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:41,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:41,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 21:58:41,301 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:41,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:41,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1884905935, now seen corresponding path program 20 times [2025-03-08 21:58:41,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:41,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184761402] [2025-03-08 21:58:41,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:41,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:41,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:41,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:41,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:41,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:41,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:41,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:41,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184761402] [2025-03-08 21:58:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184761402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:41,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:41,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169914469] [2025-03-08 21:58:41,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:41,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:41,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:41,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:41,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:41,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 365 transitions, 3523 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:41,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:41,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:41,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:42,323 INFO L124 PetriNetUnfolderBase]: 1059/3749 cut-off events. [2025-03-08 21:58:42,323 INFO L125 PetriNetUnfolderBase]: For 11924/12125 co-relation queries the response was YES. [2025-03-08 21:58:42,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 3749 events. 1059/3749 cut-off events. For 11924/12125 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 34017 event pairs, 51 based on Foata normal form. 14/3755 useless extension candidates. Maximal degree in co-relation 13321. Up to 675 conditions per place. [2025-03-08 21:58:42,338 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 37 selfloop transitions, 19 changer transitions 9/308 dead transitions. [2025-03-08 21:58:42,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 308 transitions, 2793 flow [2025-03-08 21:58:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2025-03-08 21:58:42,339 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726957726957727 [2025-03-08 21:58:42,339 INFO L175 Difference]: Start difference. First operand has 246 places, 365 transitions, 3523 flow. Second operand 13 states and 1115 transitions. [2025-03-08 21:58:42,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 308 transitions, 2793 flow [2025-03-08 21:58:42,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 308 transitions, 2660 flow, removed 38 selfloop flow, removed 22 redundant places. [2025-03-08 21:58:42,383 INFO L231 Difference]: Finished difference. Result has 228 places, 298 transitions, 2472 flow [2025-03-08 21:58:42,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2530, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2472, PETRI_PLACES=228, PETRI_TRANSITIONS=298} [2025-03-08 21:58:42,383 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 114 predicate places. [2025-03-08 21:58:42,383 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 298 transitions, 2472 flow [2025-03-08 21:58:42,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:42,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:42,384 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] [2025-03-08 21:58:42,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 21:58:42,384 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:42,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash -99169261, now seen corresponding path program 21 times [2025-03-08 21:58:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:42,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764330352] [2025-03-08 21:58:42,384 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:42,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:42,393 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:42,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:42,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:42,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:42,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764330352] [2025-03-08 21:58:42,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764330352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:42,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101829151] [2025-03-08 21:58:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:42,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:42,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:42,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:42,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:42,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 298 transitions, 2472 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:42,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:42,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:42,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:43,331 INFO L124 PetriNetUnfolderBase]: 791/2892 cut-off events. [2025-03-08 21:58:43,331 INFO L125 PetriNetUnfolderBase]: For 7854/7994 co-relation queries the response was YES. [2025-03-08 21:58:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9906 conditions, 2892 events. 791/2892 cut-off events. For 7854/7994 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 24813 event pairs, 32 based on Foata normal form. 12/2898 useless extension candidates. Maximal degree in co-relation 9851. Up to 514 conditions per place. [2025-03-08 21:58:43,344 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 35 selfloop transitions, 22 changer transitions 8/308 dead transitions. [2025-03-08 21:58:43,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 308 transitions, 2645 flow [2025-03-08 21:58:43,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1111 transitions. [2025-03-08 21:58:43,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7699237699237699 [2025-03-08 21:58:43,345 INFO L175 Difference]: Start difference. First operand has 228 places, 298 transitions, 2472 flow. Second operand 13 states and 1111 transitions. [2025-03-08 21:58:43,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 308 transitions, 2645 flow [2025-03-08 21:58:43,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 308 transitions, 2557 flow, removed 16 selfloop flow, removed 17 redundant places. [2025-03-08 21:58:43,369 INFO L231 Difference]: Finished difference. Result has 214 places, 292 transitions, 2373 flow [2025-03-08 21:58:43,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2349, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2373, PETRI_PLACES=214, PETRI_TRANSITIONS=292} [2025-03-08 21:58:43,369 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 100 predicate places. [2025-03-08 21:58:43,369 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 292 transitions, 2373 flow [2025-03-08 21:58:43,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:43,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:43,370 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] [2025-03-08 21:58:43,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 21:58:43,370 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1241921901, now seen corresponding path program 22 times [2025-03-08 21:58:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003912711] [2025-03-08 21:58:43,370 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:43,376 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:43,380 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:43,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:43,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:43,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003912711] [2025-03-08 21:58:43,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003912711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:43,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:43,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:43,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139711943] [2025-03-08 21:58:43,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:43,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:43,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:43,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:43,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:43,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:43,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 292 transitions, 2373 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:43,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:43,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:43,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:44,346 INFO L124 PetriNetUnfolderBase]: 793/2835 cut-off events. [2025-03-08 21:58:44,346 INFO L125 PetriNetUnfolderBase]: For 7566/7716 co-relation queries the response was YES. [2025-03-08 21:58:44,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 2835 events. 793/2835 cut-off events. For 7566/7716 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 24162 event pairs, 35 based on Foata normal form. 13/2842 useless extension candidates. Maximal degree in co-relation 9564. Up to 514 conditions per place. [2025-03-08 21:58:44,363 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 29 selfloop transitions, 24 changer transitions 7/301 dead transitions. [2025-03-08 21:58:44,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 301 transitions, 2548 flow [2025-03-08 21:58:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2025-03-08 21:58:44,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.772002772002772 [2025-03-08 21:58:44,365 INFO L175 Difference]: Start difference. First operand has 214 places, 292 transitions, 2373 flow. Second operand 13 states and 1114 transitions. [2025-03-08 21:58:44,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 301 transitions, 2548 flow [2025-03-08 21:58:44,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 301 transitions, 2465 flow, removed 8 selfloop flow, removed 16 redundant places. [2025-03-08 21:58:44,393 INFO L231 Difference]: Finished difference. Result has 207 places, 289 transitions, 2322 flow [2025-03-08 21:58:44,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2322, PETRI_PLACES=207, PETRI_TRANSITIONS=289} [2025-03-08 21:58:44,394 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 93 predicate places. [2025-03-08 21:58:44,394 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 289 transitions, 2322 flow [2025-03-08 21:58:44,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:44,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:44,394 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] [2025-03-08 21:58:44,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 21:58:44,394 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:44,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:44,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1896386003, now seen corresponding path program 23 times [2025-03-08 21:58:44,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:44,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747462503] [2025-03-08 21:58:44,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:44,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:44,402 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:44,405 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:44,405 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:44,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747462503] [2025-03-08 21:58:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747462503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:44,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292930719] [2025-03-08 21:58:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:44,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:45,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:45,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 289 transitions, 2322 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:45,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:45,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:45,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:45,430 INFO L124 PetriNetUnfolderBase]: 790/2853 cut-off events. [2025-03-08 21:58:45,430 INFO L125 PetriNetUnfolderBase]: For 7496/7646 co-relation queries the response was YES. [2025-03-08 21:58:45,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9607 conditions, 2853 events. 790/2853 cut-off events. For 7496/7646 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 24408 event pairs, 36 based on Foata normal form. 10/2857 useless extension candidates. Maximal degree in co-relation 9562. Up to 516 conditions per place. [2025-03-08 21:58:45,442 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 30 selfloop transitions, 21 changer transitions 6/298 dead transitions. [2025-03-08 21:58:45,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 298 transitions, 2491 flow [2025-03-08 21:58:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1115 transitions. [2025-03-08 21:58:45,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7726957726957727 [2025-03-08 21:58:45,443 INFO L175 Difference]: Start difference. First operand has 207 places, 289 transitions, 2322 flow. Second operand 13 states and 1115 transitions. [2025-03-08 21:58:45,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 298 transitions, 2491 flow [2025-03-08 21:58:45,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 298 transitions, 2440 flow, removed 3 selfloop flow, removed 11 redundant places. [2025-03-08 21:58:45,466 INFO L231 Difference]: Finished difference. Result has 210 places, 289 transitions, 2331 flow [2025-03-08 21:58:45,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2276, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2331, PETRI_PLACES=210, PETRI_TRANSITIONS=289} [2025-03-08 21:58:45,466 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 96 predicate places. [2025-03-08 21:58:45,467 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 289 transitions, 2331 flow [2025-03-08 21:58:45,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:45,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:45,467 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] [2025-03-08 21:58:45,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 21:58:45,467 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:45,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:45,467 INFO L85 PathProgramCache]: Analyzing trace with hash 142085077, now seen corresponding path program 24 times [2025-03-08 21:58:45,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:45,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378023257] [2025-03-08 21:58:45,467 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:45,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:45,473 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:45,476 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:45,476 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:45,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378023257] [2025-03-08 21:58:45,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378023257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:45,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:45,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:45,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900449765] [2025-03-08 21:58:45,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:45,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:45,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:45,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:46,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:46,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 289 transitions, 2331 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:46,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:46,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:46,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:46,356 INFO L124 PetriNetUnfolderBase]: 525/2012 cut-off events. [2025-03-08 21:58:46,357 INFO L125 PetriNetUnfolderBase]: For 4876/4983 co-relation queries the response was YES. [2025-03-08 21:58:46,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6654 conditions, 2012 events. 525/2012 cut-off events. For 4876/4983 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15605 event pairs, 25 based on Foata normal form. 7/2015 useless extension candidates. Maximal degree in co-relation 6607. Up to 348 conditions per place. [2025-03-08 21:58:46,369 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 23 selfloop transitions, 15 changer transitions 15/275 dead transitions. [2025-03-08 21:58:46,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 275 transitions, 2141 flow [2025-03-08 21:58:46,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:46,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1110 transitions. [2025-03-08 21:58:46,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2025-03-08 21:58:46,370 INFO L175 Difference]: Start difference. First operand has 210 places, 289 transitions, 2331 flow. Second operand 13 states and 1110 transitions. [2025-03-08 21:58:46,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 275 transitions, 2141 flow [2025-03-08 21:58:46,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 275 transitions, 2088 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-03-08 21:58:46,391 INFO L231 Difference]: Finished difference. Result has 209 places, 259 transitions, 1881 flow [2025-03-08 21:58:46,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1881, PETRI_PLACES=209, PETRI_TRANSITIONS=259} [2025-03-08 21:58:46,391 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 95 predicate places. [2025-03-08 21:58:46,391 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 259 transitions, 1881 flow [2025-03-08 21:58:46,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:46,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:46,391 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] [2025-03-08 21:58:46,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 21:58:46,391 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:46,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2005159373, now seen corresponding path program 25 times [2025-03-08 21:58:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:46,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276459024] [2025-03-08 21:58:46,392 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:46,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:58:46,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:46,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:46,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276459024] [2025-03-08 21:58:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276459024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056318053] [2025-03-08 21:58:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:46,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:46,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:46,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:46,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:46,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 259 transitions, 1881 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:46,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:46,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:47,331 INFO L124 PetriNetUnfolderBase]: 774/2736 cut-off events. [2025-03-08 21:58:47,331 INFO L125 PetriNetUnfolderBase]: For 6629/6769 co-relation queries the response was YES. [2025-03-08 21:58:47,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9037 conditions, 2736 events. 774/2736 cut-off events. For 6629/6769 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23348 event pairs, 30 based on Foata normal form. 13/2743 useless extension candidates. Maximal degree in co-relation 8991. Up to 504 conditions per place. [2025-03-08 21:58:47,353 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 26 selfloop transitions, 25 changer transitions 1/274 dead transitions. [2025-03-08 21:58:47,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 274 transitions, 2069 flow [2025-03-08 21:58:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1116 transitions. [2025-03-08 21:58:47,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7733887733887734 [2025-03-08 21:58:47,354 INFO L175 Difference]: Start difference. First operand has 209 places, 259 transitions, 1881 flow. Second operand 13 states and 1116 transitions. [2025-03-08 21:58:47,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 274 transitions, 2069 flow [2025-03-08 21:58:47,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 274 transitions, 1961 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-03-08 21:58:47,383 INFO L231 Difference]: Finished difference. Result has 194 places, 267 transitions, 1920 flow [2025-03-08 21:58:47,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1920, PETRI_PLACES=194, PETRI_TRANSITIONS=267} [2025-03-08 21:58:47,384 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 80 predicate places. [2025-03-08 21:58:47,384 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 267 transitions, 1920 flow [2025-03-08 21:58:47,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:47,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:47,384 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] [2025-03-08 21:58:47,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 21:58:47,384 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1188411256, now seen corresponding path program 22 times [2025-03-08 21:58:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30067500] [2025-03-08 21:58:47,385 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:47,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:47,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:47,394 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:47,394 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:47,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:47,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30067500] [2025-03-08 21:58:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30067500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:47,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:47,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:58:47,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045239794] [2025-03-08 21:58:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:47,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:58:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:47,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:58:47,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:58:48,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-03-08 21:58:48,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 267 transitions, 1920 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:48,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:48,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-03-08 21:58:48,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:48,759 INFO L124 PetriNetUnfolderBase]: 1406/4302 cut-off events. [2025-03-08 21:58:48,759 INFO L125 PetriNetUnfolderBase]: For 14666/15186 co-relation queries the response was YES. [2025-03-08 21:58:48,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16274 conditions, 4302 events. 1406/4302 cut-off events. For 14666/15186 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 37965 event pairs, 59 based on Foata normal form. 123/4407 useless extension candidates. Maximal degree in co-relation 16231. Up to 1164 conditions per place. [2025-03-08 21:58:48,783 INFO L140 encePairwiseOnDemand]: 86/111 looper letters, 326 selfloop transitions, 100 changer transitions 70/589 dead transitions. [2025-03-08 21:58:48,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 589 transitions, 5797 flow [2025-03-08 21:58:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 21:58:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-08 21:58:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1616 transitions. [2025-03-08 21:58:48,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7279279279279279 [2025-03-08 21:58:48,785 INFO L175 Difference]: Start difference. First operand has 194 places, 267 transitions, 1920 flow. Second operand 20 states and 1616 transitions. [2025-03-08 21:58:48,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 589 transitions, 5797 flow [2025-03-08 21:58:48,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 589 transitions, 5748 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-03-08 21:58:48,821 INFO L231 Difference]: Finished difference. Result has 216 places, 332 transitions, 2980 flow [2025-03-08 21:58:48,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1886, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2980, PETRI_PLACES=216, PETRI_TRANSITIONS=332} [2025-03-08 21:58:48,821 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 102 predicate places. [2025-03-08 21:58:48,821 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 332 transitions, 2980 flow [2025-03-08 21:58:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:48,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:48,822 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] [2025-03-08 21:58:48,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 21:58:48,822 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:48,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1379666112, now seen corresponding path program 23 times [2025-03-08 21:58:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79341697] [2025-03-08 21:58:48,822 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 21:58:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:48,829 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:48,831 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:48,832 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 21:58:48,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:49,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:49,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79341697] [2025-03-08 21:58:49,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79341697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:49,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:49,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004164544] [2025-03-08 21:58:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:49,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:49,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:49,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:49,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:49,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 332 transitions, 2980 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:49,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:49,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:49,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:49,856 INFO L124 PetriNetUnfolderBase]: 1093/3716 cut-off events. [2025-03-08 21:58:49,856 INFO L125 PetriNetUnfolderBase]: For 12788/13034 co-relation queries the response was YES. [2025-03-08 21:58:49,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13524 conditions, 3716 events. 1093/3716 cut-off events. For 12788/13034 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 33771 event pairs, 41 based on Foata normal form. 30/3738 useless extension candidates. Maximal degree in co-relation 13470. Up to 701 conditions per place. [2025-03-08 21:58:49,879 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 37 selfloop transitions, 28 changer transitions 3/344 dead transitions. [2025-03-08 21:58:49,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 344 transitions, 3201 flow [2025-03-08 21:58:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1114 transitions. [2025-03-08 21:58:49,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.772002772002772 [2025-03-08 21:58:49,880 INFO L175 Difference]: Start difference. First operand has 216 places, 332 transitions, 2980 flow. Second operand 13 states and 1114 transitions. [2025-03-08 21:58:49,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 344 transitions, 3201 flow [2025-03-08 21:58:49,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 344 transitions, 3140 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-08 21:58:49,928 INFO L231 Difference]: Finished difference. Result has 222 places, 334 transitions, 3019 flow [2025-03-08 21:58:49,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2926, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3019, PETRI_PLACES=222, PETRI_TRANSITIONS=334} [2025-03-08 21:58:49,928 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 108 predicate places. [2025-03-08 21:58:49,929 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 334 transitions, 3019 flow [2025-03-08 21:58:49,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:49,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:49,929 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] [2025-03-08 21:58:49,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 21:58:49,929 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1560487624, now seen corresponding path program 24 times [2025-03-08 21:58:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:49,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978236919] [2025-03-08 21:58:49,930 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 21:58:49,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:49,936 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:49,939 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:49,939 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 21:58:49,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978236919] [2025-03-08 21:58:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978236919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601513713] [2025-03-08 21:58:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:50,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:50,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:50,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:50,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:50,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 334 transitions, 3019 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:50,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:50,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:50,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:50,921 INFO L124 PetriNetUnfolderBase]: 824/2878 cut-off events. [2025-03-08 21:58:50,921 INFO L125 PetriNetUnfolderBase]: For 10055/10252 co-relation queries the response was YES. [2025-03-08 21:58:50,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10390 conditions, 2878 events. 824/2878 cut-off events. For 10055/10252 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 24658 event pairs, 29 based on Foata normal form. 22/2894 useless extension candidates. Maximal degree in co-relation 10334. Up to 530 conditions per place. [2025-03-08 21:58:50,938 INFO L140 encePairwiseOnDemand]: 94/111 looper letters, 33 selfloop transitions, 19 changer transitions 8/336 dead transitions. [2025-03-08 21:58:50,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 336 transitions, 3135 flow [2025-03-08 21:58:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1108 transitions. [2025-03-08 21:58:50,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7678447678447679 [2025-03-08 21:58:50,939 INFO L175 Difference]: Start difference. First operand has 222 places, 334 transitions, 3019 flow. Second operand 13 states and 1108 transitions. [2025-03-08 21:58:50,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 336 transitions, 3135 flow [2025-03-08 21:58:50,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 336 transitions, 3070 flow, removed 8 selfloop flow, removed 12 redundant places. [2025-03-08 21:58:50,973 INFO L231 Difference]: Finished difference. Result has 224 places, 325 transitions, 2921 flow [2025-03-08 21:58:50,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2904, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2921, PETRI_PLACES=224, PETRI_TRANSITIONS=325} [2025-03-08 21:58:50,973 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 110 predicate places. [2025-03-08 21:58:50,973 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 325 transitions, 2921 flow [2025-03-08 21:58:50,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:50,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:50,973 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] [2025-03-08 21:58:50,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 21:58:50,973 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:50,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash -554400382, now seen corresponding path program 25 times [2025-03-08 21:58:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818148413] [2025-03-08 21:58:50,974 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 21:58:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:50,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 21:58:50,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:50,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:58:50,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:51,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818148413] [2025-03-08 21:58:51,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818148413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:51,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:51,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:51,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164657326] [2025-03-08 21:58:51,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:51,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:51,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:51,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:51,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:51,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:51,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 325 transitions, 2921 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:51,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:51,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:51,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:51,967 INFO L124 PetriNetUnfolderBase]: 824/2849 cut-off events. [2025-03-08 21:58:51,967 INFO L125 PetriNetUnfolderBase]: For 9943/10127 co-relation queries the response was YES. [2025-03-08 21:58:51,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10293 conditions, 2849 events. 824/2849 cut-off events. For 9943/10127 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 24477 event pairs, 31 based on Foata normal form. 37/2880 useless extension candidates. Maximal degree in co-relation 10237. Up to 528 conditions per place. [2025-03-08 21:58:51,984 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 18 selfloop transitions, 33 changer transitions 4/331 dead transitions. [2025-03-08 21:58:51,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 331 transitions, 3114 flow [2025-03-08 21:58:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1107 transitions. [2025-03-08 21:58:51,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7671517671517671 [2025-03-08 21:58:51,985 INFO L175 Difference]: Start difference. First operand has 224 places, 325 transitions, 2921 flow. Second operand 13 states and 1107 transitions. [2025-03-08 21:58:51,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 331 transitions, 3114 flow [2025-03-08 21:58:52,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 331 transitions, 2996 flow, removed 9 selfloop flow, removed 18 redundant places. [2025-03-08 21:58:52,017 INFO L231 Difference]: Finished difference. Result has 213 places, 325 transitions, 2925 flow [2025-03-08 21:58:52,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2824, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2925, PETRI_PLACES=213, PETRI_TRANSITIONS=325} [2025-03-08 21:58:52,017 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 99 predicate places. [2025-03-08 21:58:52,017 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 325 transitions, 2925 flow [2025-03-08 21:58:52,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:52,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:52,018 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] [2025-03-08 21:58:52,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 21:58:52,018 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:52,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:52,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1304707274, now seen corresponding path program 26 times [2025-03-08 21:58:52,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:52,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258327612] [2025-03-08 21:58:52,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:52,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:52,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:52,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:52,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:52,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:52,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258327612] [2025-03-08 21:58:52,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258327612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:52,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:52,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:52,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965664951] [2025-03-08 21:58:52,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:52,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:52,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:52,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:52,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:52,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 325 transitions, 2925 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:52,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:52,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:52,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:52,953 INFO L124 PetriNetUnfolderBase]: 559/2019 cut-off events. [2025-03-08 21:58:52,953 INFO L125 PetriNetUnfolderBase]: For 6949/7065 co-relation queries the response was YES. [2025-03-08 21:58:52,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 2019 events. 559/2019 cut-off events. For 6949/7065 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15773 event pairs, 21 based on Foata normal form. 12/2027 useless extension candidates. Maximal degree in co-relation 7251. Up to 364 conditions per place. [2025-03-08 21:58:52,964 INFO L140 encePairwiseOnDemand]: 93/111 looper letters, 23 selfloop transitions, 20 changer transitions 7/326 dead transitions. [2025-03-08 21:58:52,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 326 transitions, 3034 flow [2025-03-08 21:58:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1104 transitions. [2025-03-08 21:58:52,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7650727650727651 [2025-03-08 21:58:52,965 INFO L175 Difference]: Start difference. First operand has 213 places, 325 transitions, 2925 flow. Second operand 13 states and 1104 transitions. [2025-03-08 21:58:52,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 326 transitions, 3034 flow [2025-03-08 21:58:52,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 326 transitions, 2952 flow, removed 8 selfloop flow, removed 13 redundant places. [2025-03-08 21:58:52,988 INFO L231 Difference]: Finished difference. Result has 213 places, 317 transitions, 2815 flow [2025-03-08 21:58:52,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2809, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2815, PETRI_PLACES=213, PETRI_TRANSITIONS=317} [2025-03-08 21:58:52,989 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 99 predicate places. [2025-03-08 21:58:52,989 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 317 transitions, 2815 flow [2025-03-08 21:58:52,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:52,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:52,989 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] [2025-03-08 21:58:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 21:58:52,989 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash -893314078, now seen corresponding path program 27 times [2025-03-08 21:58:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505759617] [2025-03-08 21:58:52,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:52,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:53,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:53,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:53,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:53,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505759617] [2025-03-08 21:58:53,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505759617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:53,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:53,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155991691] [2025-03-08 21:58:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:53,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:53,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:53,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:53,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 317 transitions, 2815 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:53,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:53,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:53,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:53,841 INFO L124 PetriNetUnfolderBase]: 555/1985 cut-off events. [2025-03-08 21:58:53,841 INFO L125 PetriNetUnfolderBase]: For 6240/6354 co-relation queries the response was YES. [2025-03-08 21:58:53,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 1985 events. 555/1985 cut-off events. For 6240/6354 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15446 event pairs, 21 based on Foata normal form. 24/2005 useless extension candidates. Maximal degree in co-relation 7011. Up to 364 conditions per place. [2025-03-08 21:58:53,851 INFO L140 encePairwiseOnDemand]: 90/111 looper letters, 13 selfloop transitions, 30 changer transitions 6/323 dead transitions. [2025-03-08 21:58:53,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 323 transitions, 2975 flow [2025-03-08 21:58:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1102 transitions. [2025-03-08 21:58:53,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7636867636867637 [2025-03-08 21:58:53,852 INFO L175 Difference]: Start difference. First operand has 213 places, 317 transitions, 2815 flow. Second operand 13 states and 1102 transitions. [2025-03-08 21:58:53,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 323 transitions, 2975 flow [2025-03-08 21:58:53,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 323 transitions, 2862 flow, removed 14 selfloop flow, removed 15 redundant places. [2025-03-08 21:58:53,873 INFO L231 Difference]: Finished difference. Result has 206 places, 314 transitions, 2767 flow [2025-03-08 21:58:53,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2722, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2767, PETRI_PLACES=206, PETRI_TRANSITIONS=314} [2025-03-08 21:58:53,874 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 92 predicate places. [2025-03-08 21:58:53,874 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 314 transitions, 2767 flow [2025-03-08 21:58:53,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:53,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:53,874 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] [2025-03-08 21:58:53,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 21:58:53,874 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:53,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:53,875 INFO L85 PathProgramCache]: Analyzing trace with hash 711283814, now seen corresponding path program 28 times [2025-03-08 21:58:53,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:53,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877257704] [2025-03-08 21:58:53,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 21:58:53,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:53,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:53,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 21:58:53,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 21:58:53,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:54,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:54,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877257704] [2025-03-08 21:58:54,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877257704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:54,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:54,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 21:58:54,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021089639] [2025-03-08 21:58:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:54,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 21:58:54,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:54,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 21:58:54,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-08 21:58:54,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 111 [2025-03-08 21:58:54,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 314 transitions, 2767 flow. Second operand has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:54,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:54,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 111 [2025-03-08 21:58:54,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:55,204 INFO L124 PetriNetUnfolderBase]: 750/2393 cut-off events. [2025-03-08 21:58:55,204 INFO L125 PetriNetUnfolderBase]: For 10385/10670 co-relation queries the response was YES. [2025-03-08 21:58:55,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9753 conditions, 2393 events. 750/2393 cut-off events. For 10385/10670 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 18560 event pairs, 57 based on Foata normal form. 70/2451 useless extension candidates. Maximal degree in co-relation 9705. Up to 522 conditions per place. [2025-03-08 21:58:55,215 INFO L140 encePairwiseOnDemand]: 88/111 looper letters, 331 selfloop transitions, 92 changer transitions 36/551 dead transitions. [2025-03-08 21:58:55,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 551 transitions, 5887 flow [2025-03-08 21:58:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 21:58:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-08 21:58:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1524 transitions. [2025-03-08 21:58:55,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7226173541963016 [2025-03-08 21:58:55,216 INFO L175 Difference]: Start difference. First operand has 206 places, 314 transitions, 2767 flow. Second operand 19 states and 1524 transitions. [2025-03-08 21:58:55,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 551 transitions, 5887 flow [2025-03-08 21:58:55,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 551 transitions, 5780 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-03-08 21:58:55,241 INFO L231 Difference]: Finished difference. Result has 217 places, 344 transitions, 3314 flow [2025-03-08 21:58:55,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2694, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3314, PETRI_PLACES=217, PETRI_TRANSITIONS=344} [2025-03-08 21:58:55,242 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 103 predicate places. [2025-03-08 21:58:55,242 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 344 transitions, 3314 flow [2025-03-08 21:58:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 73.6) internal successors, (1104), 15 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:55,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:55,242 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] [2025-03-08 21:58:55,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-08 21:58:55,242 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:55,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1705359603, now seen corresponding path program 26 times [2025-03-08 21:58:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665570821] [2025-03-08 21:58:55,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:58:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:55,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:55,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:55,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:58:55,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:55,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:55,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665570821] [2025-03-08 21:58:55,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665570821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:55,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:55,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:55,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603694397] [2025-03-08 21:58:55,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:55,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:55,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:55,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:55,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:55,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:55,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 344 transitions, 3314 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:55,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:55,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:55,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:55,958 INFO L124 PetriNetUnfolderBase]: 288/1134 cut-off events. [2025-03-08 21:58:55,958 INFO L125 PetriNetUnfolderBase]: For 4125/4170 co-relation queries the response was YES. [2025-03-08 21:58:55,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4169 conditions, 1134 events. 288/1134 cut-off events. For 4125/4170 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7505 event pairs, 9 based on Foata normal form. 10/1142 useless extension candidates. Maximal degree in co-relation 4115. Up to 193 conditions per place. [2025-03-08 21:58:55,964 INFO L140 encePairwiseOnDemand]: 92/111 looper letters, 14 selfloop transitions, 20 changer transitions 6/285 dead transitions. [2025-03-08 21:58:55,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 285 transitions, 2510 flow [2025-03-08 21:58:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:55,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1100 transitions. [2025-03-08 21:58:55,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623007623007623 [2025-03-08 21:58:55,965 INFO L175 Difference]: Start difference. First operand has 217 places, 344 transitions, 3314 flow. Second operand 13 states and 1100 transitions. [2025-03-08 21:58:55,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 285 transitions, 2510 flow [2025-03-08 21:58:55,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 285 transitions, 2313 flow, removed 46 selfloop flow, removed 24 redundant places. [2025-03-08 21:58:55,980 INFO L231 Difference]: Finished difference. Result has 198 places, 279 transitions, 2235 flow [2025-03-08 21:58:55,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2235, PETRI_PLACES=198, PETRI_TRANSITIONS=279} [2025-03-08 21:58:55,980 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 84 predicate places. [2025-03-08 21:58:55,980 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 279 transitions, 2235 flow [2025-03-08 21:58:55,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:55,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:58:55,981 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] [2025-03-08 21:58:55,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-08 21:58:55,981 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-03-08 21:58:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:58:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash 489685037, now seen corresponding path program 27 times [2025-03-08 21:58:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:58:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055860896] [2025-03-08 21:58:55,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 21:58:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:58:55,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 2 equivalence classes. [2025-03-08 21:58:55,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 69 statements. [2025-03-08 21:58:55,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 21:58:55,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:58:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 21:58:56,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:58:56,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055860896] [2025-03-08 21:58:56,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055860896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:58:56,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:58:56,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 21:58:56,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175856870] [2025-03-08 21:58:56,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:58:56,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 21:58:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:58:56,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 21:58:56,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-08 21:58:56,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 111 [2025-03-08 21:58:56,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 279 transitions, 2235 flow. Second operand has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:58:56,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 111 [2025-03-08 21:58:56,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:58:56,642 INFO L124 PetriNetUnfolderBase]: 2/75 cut-off events. [2025-03-08 21:58:56,642 INFO L125 PetriNetUnfolderBase]: For 71/72 co-relation queries the response was YES. [2025-03-08 21:58:56,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 75 events. 2/75 cut-off events. For 71/72 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 18 event pairs, 0 based on Foata normal form. 5/80 useless extension candidates. Maximal degree in co-relation 178. Up to 7 conditions per place. [2025-03-08 21:58:56,643 INFO L140 encePairwiseOnDemand]: 96/111 looper letters, 0 selfloop transitions, 0 changer transitions 71/71 dead transitions. [2025-03-08 21:58:56,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 71 transitions, 333 flow [2025-03-08 21:58:56,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 21:58:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-08 21:58:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1088 transitions. [2025-03-08 21:58:56,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.753984753984754 [2025-03-08 21:58:56,644 INFO L175 Difference]: Start difference. First operand has 198 places, 279 transitions, 2235 flow. Second operand 13 states and 1088 transitions. [2025-03-08 21:58:56,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 71 transitions, 333 flow [2025-03-08 21:58:56,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 71 transitions, 203 flow, removed 19 selfloop flow, removed 42 redundant places. [2025-03-08 21:58:56,644 INFO L231 Difference]: Finished difference. Result has 109 places, 0 transitions, 0 flow [2025-03-08 21:58:56,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=109, PETRI_TRANSITIONS=0} [2025-03-08 21:58:56,645 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -5 predicate places. [2025-03-08 21:58:56,645 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 0 transitions, 0 flow [2025-03-08 21:58:56,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 83.6923076923077) internal successors, (1088), 13 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 21:58:56,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-08 21:58:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-08 21:58:56,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-08 21:58:56,650 INFO L422 BasicCegarLoop]: Path program histogram: [28, 27, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:58:56,653 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:58:56,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:58:56,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:58:56 BasicIcfg [2025-03-08 21:58:56,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:58:56,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:58:56,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:58:56,657 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:58:56,657 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:57:39" (3/4) ... [2025-03-08 21:58:56,658 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:58:56,660 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-08 21:58:56,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 21:58:56,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:58:56,663 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 21:58:56,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:58:56,711 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:58:56,711 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:58:56,712 INFO L158 Benchmark]: Toolchain (without parser) took 77548.05ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 112.1MB in the beginning and 448.7MB in the end (delta: -336.7MB). Peak memory consumption was 381.4MB. Max. memory is 16.1GB. [2025-03-08 21:58:56,713 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:58:56,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.42ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 89.1MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:58:56,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:58:56,714 INFO L158 Benchmark]: Boogie Preprocessor took 20.04ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 85.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:58:56,714 INFO L158 Benchmark]: IcfgBuilder took 351.42ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 68.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:58:56,714 INFO L158 Benchmark]: TraceAbstraction took 76742.77ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 67.9MB in the beginning and 452.8MB in the end (delta: -384.9MB). Peak memory consumption was 347.8MB. Max. memory is 16.1GB. [2025-03-08 21:58:56,714 INFO L158 Benchmark]: Witness Printer took 54.65ms. Allocated memory is still 864.0MB. Free memory was 452.8MB in the beginning and 448.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:58:56,716 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.42ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 89.1MB in the end (delta: 23.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.43ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 86.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.04ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 85.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 351.42ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 68.4MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 76742.77ms. Allocated memory was 142.6MB in the beginning and 864.0MB in the end (delta: 721.4MB). Free memory was 67.9MB in the beginning and 452.8MB in the end (delta: -384.9MB). Peak memory consumption was 347.8MB. Max. memory is 16.1GB. * Witness Printer took 54.65ms. Allocated memory is still 864.0MB. Free memory was 452.8MB in the beginning and 448.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3010]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3011]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 2995]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3013]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3005]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 3001]: 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 3 procedures, 149 locations, 147 edges, 13 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: 76.6s, OverallIterations: 62, TraceHistogramMax: 1, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.0s, AutomataDifference: 60.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31545 SdHoareTripleChecker+Valid, 28.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27367 mSDsluCounter, 119715 SdHoareTripleChecker+Invalid, 23.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117428 mSDsCounter, 526 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79416 IncrementalHoareTripleChecker+Invalid, 79942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 526 mSolverCounterUnsat, 2287 mSDtfsCounter, 79416 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1320 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2555 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4674occurred in iteration=28, InterpolantAutomatonStates: 789, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 4061 NumberOfCodeBlocks, 4005 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 3999 ConstructedInterpolants, 0 QuantifiedInterpolants, 20692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 62 InterpolantComputations, 62 PerfectInterpolantSequences, 171/171 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 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:58:56,729 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