./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.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/pthread/queue_ok_longer.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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:34:56,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:34:56,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:34:56,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:34:56,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:34:56,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:34:56,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:34:56,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:34:56,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:34:56,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:34:56,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:34:56,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:34:56,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:34:56,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:34:56,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:34:56,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:34:56,898 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2025-03-08 21:34:57,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:34:57,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:34:57,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:34:57,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:34:57,124 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:34:57,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2025-03-08 21:34:58,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade2b86b6/89f760872405477f83c54a5d6334a3e6/FLAGf0a80ba0f [2025-03-08 21:34:58,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:34:58,593 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2025-03-08 21:34:58,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade2b86b6/89f760872405477f83c54a5d6334a3e6/FLAGf0a80ba0f [2025-03-08 21:34:58,626 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade2b86b6/89f760872405477f83c54a5d6334a3e6 [2025-03-08 21:34:58,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:34:58,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:34:58,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:34:58,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:34:58,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:34:58,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:34:58" (1/1) ... [2025-03-08 21:34:58,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2262532d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:58, skipping insertion in model container [2025-03-08 21:34:58,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:34:58" (1/1) ... [2025-03-08 21:34:58,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:34:58,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:34:59,002 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:34:59,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:34:59,148 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:34:59,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59 WrapperNode [2025-03-08 21:34:59,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:34:59,150 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:34:59,150 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:34:59,150 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:34:59,153 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:34:59" (1/1) ... [2025-03-08 21:34:59,176 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:34:59" (1/1) ... [2025-03-08 21:34:59,240 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1169 [2025-03-08 21:34:59,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:34:59,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:34:59,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:34:59,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:34:59,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:34:59,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:34:59,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:34:59,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:34:59,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (1/1) ... [2025-03-08 21:34:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:34:59,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:34:59,349 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:34:59,352 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:34:59,369 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-08 21:34:59,370 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-08 21:34:59,370 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:34:59,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:34:59,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:34:59,371 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:34:59,496 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:34:59,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:35:00,655 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:35:00,655 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:35:00,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:35:00,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:35:00,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:00 BoogieIcfgContainer [2025-03-08 21:35:00,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:35:00,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:35:00,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:35:00,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:35:00,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:34:58" (1/3) ... [2025-03-08 21:35:00,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7dcf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:00, skipping insertion in model container [2025-03-08 21:35:00,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:34:59" (2/3) ... [2025-03-08 21:35:00,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7dcf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:35:00, skipping insertion in model container [2025-03-08 21:35:00,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:35:00" (3/3) ... [2025-03-08 21:35:00,709 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2025-03-08 21:35:00,722 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:35:00,724 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 1220 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-08 21:35:00,724 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:35:00,888 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 21:35:00,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1226 places, 1232 transitions, 2478 flow [2025-03-08 21:35:01,366 INFO L124 PetriNetUnfolderBase]: 13/1230 cut-off events. [2025-03-08 21:35:01,369 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:35:01,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 1230 events. 13/1230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 742 event pairs, 0 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 1055. Up to 3 conditions per place. [2025-03-08 21:35:01,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 1226 places, 1232 transitions, 2478 flow [2025-03-08 21:35:01,395 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1219 places, 1225 transitions, 2459 flow [2025-03-08 21:35:01,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:35:01,413 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;@2204ab58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:35:01,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-08 21:35:01,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:35:01,534 INFO L124 PetriNetUnfolderBase]: 0/830 cut-off events. [2025-03-08 21:35:01,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:35:01,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:01,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:01,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:01,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1323852543, now seen corresponding path program 1 times [2025-03-08 21:35:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:01,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842629005] [2025-03-08 21:35:01,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:01,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-08 21:35:01,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-08 21:35:01,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:01,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:02,318 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:35:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:02,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842629005] [2025-03-08 21:35:02,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842629005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:02,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:02,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540820167] [2025-03-08 21:35:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:02,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:02,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:02,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:02,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:02,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1207 out of 1232 [2025-03-08 21:35:02,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1219 places, 1225 transitions, 2459 flow. Second operand has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 0 states have call successors, (0), 0 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:35:02,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:02,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1207 of 1232 [2025-03-08 21:35:02,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:02,779 INFO L124 PetriNetUnfolderBase]: 40/1746 cut-off events. [2025-03-08 21:35:02,779 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-08 21:35:02,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 1746 events. 40/1746 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4413 event pairs, 19 based on Foata normal form. 3/1641 useless extension candidates. Maximal degree in co-relation 1056. Up to 52 conditions per place. [2025-03-08 21:35:02,791 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1212 dead transitions. [2025-03-08 21:35:02,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1212 transitions, 2463 flow [2025-03-08 21:35:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3640 transitions. [2025-03-08 21:35:02,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9848484848484849 [2025-03-08 21:35:02,808 INFO L175 Difference]: Start difference. First operand has 1219 places, 1225 transitions, 2459 flow. Second operand 3 states and 3640 transitions. [2025-03-08 21:35:02,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1212 transitions, 2463 flow [2025-03-08 21:35:02,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1212 transitions, 2458 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:35:02,832 INFO L231 Difference]: Finished difference. Result has 1209 places, 1212 transitions, 2432 flow [2025-03-08 21:35:02,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=1207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2432, PETRI_PLACES=1209, PETRI_TRANSITIONS=1212} [2025-03-08 21:35:02,838 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-08 21:35:02,838 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1212 transitions, 2432 flow [2025-03-08 21:35:02,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 0 states have call successors, (0), 0 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:35:02,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:02,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:02,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:35:02,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:02,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1016471969, now seen corresponding path program 1 times [2025-03-08 21:35:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:02,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73766100] [2025-03-08 21:35:02,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:02,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:02,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-08 21:35:02,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-08 21:35:02,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:03,342 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:35:03,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:03,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73766100] [2025-03-08 21:35:03,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73766100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:03,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:03,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:03,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748347585] [2025-03-08 21:35:03,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:03,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:03,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:03,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:03,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1207 out of 1232 [2025-03-08 21:35:03,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1212 transitions, 2432 flow. Second operand has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 0 states have call successors, (0), 0 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:35:03,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:03,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1207 of 1232 [2025-03-08 21:35:03,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:03,726 INFO L124 PetriNetUnfolderBase]: 43/1874 cut-off events. [2025-03-08 21:35:03,727 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 21:35:03,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1874 events. 43/1874 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5456 event pairs, 19 based on Foata normal form. 0/1756 useless extension candidates. Maximal degree in co-relation 1104. Up to 52 conditions per place. [2025-03-08 21:35:03,736 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1211 dead transitions. [2025-03-08 21:35:03,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1210 places, 1211 transitions, 2460 flow [2025-03-08 21:35:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3637 transitions. [2025-03-08 21:35:03,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9840367965367965 [2025-03-08 21:35:03,747 INFO L175 Difference]: Start difference. First operand has 1209 places, 1212 transitions, 2432 flow. Second operand 3 states and 3637 transitions. [2025-03-08 21:35:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1210 places, 1211 transitions, 2460 flow [2025-03-08 21:35:03,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1211 transitions, 2456 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:03,767 INFO L231 Difference]: Finished difference. Result has 1208 places, 1211 transitions, 2430 flow [2025-03-08 21:35:03,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=1206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2430, PETRI_PLACES=1208, PETRI_TRANSITIONS=1211} [2025-03-08 21:35:03,770 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-08 21:35:03,770 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1211 transitions, 2430 flow [2025-03-08 21:35:03,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 0 states have call successors, (0), 0 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:35:03,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:03,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:03,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:35:03,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -635963254, now seen corresponding path program 1 times [2025-03-08 21:35:03,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:03,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959885025] [2025-03-08 21:35:03,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:03,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:03,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 846 statements into 1 equivalence classes. [2025-03-08 21:35:03,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 846 of 846 statements. [2025-03-08 21:35:03,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:03,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:06,501 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:35:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:06,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959885025] [2025-03-08 21:35:06,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959885025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:06,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:06,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167806913] [2025-03-08 21:35:06,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:06,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:06,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:06,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:06,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1118 out of 1232 [2025-03-08 21:35:06,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1211 transitions, 2430 flow. Second operand has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 0 states have call successors, (0), 0 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:35:06,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:06,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1118 of 1232 [2025-03-08 21:35:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:09,457 INFO L124 PetriNetUnfolderBase]: 2177/9951 cut-off events. [2025-03-08 21:35:09,458 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-08 21:35:09,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14053 conditions, 9951 events. 2177/9951 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 80129 event pairs, 1832 based on Foata normal form. 0/8995 useless extension candidates. Maximal degree in co-relation 13212. Up to 4014 conditions per place. [2025-03-08 21:35:09,519 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 100 selfloop transitions, 5 changer transitions 0/1210 dead transitions. [2025-03-08 21:35:09,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1210 transitions, 2638 flow [2025-03-08 21:35:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6814 transitions. [2025-03-08 21:35:09,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218073593073594 [2025-03-08 21:35:09,532 INFO L175 Difference]: Start difference. First operand has 1208 places, 1211 transitions, 2430 flow. Second operand 6 states and 6814 transitions. [2025-03-08 21:35:09,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1210 transitions, 2638 flow [2025-03-08 21:35:09,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1210 places, 1210 transitions, 2634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:09,550 INFO L231 Difference]: Finished difference. Result has 1210 places, 1210 transitions, 2434 flow [2025-03-08 21:35:09,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2424, PETRI_DIFFERENCE_MINUEND_PLACES=1205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2434, PETRI_PLACES=1210, PETRI_TRANSITIONS=1210} [2025-03-08 21:35:09,554 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -9 predicate places. [2025-03-08 21:35:09,554 INFO L471 AbstractCegarLoop]: Abstraction has has 1210 places, 1210 transitions, 2434 flow [2025-03-08 21:35:09,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 0 states have call successors, (0), 0 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:35:09,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:09,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:09,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:35:09,558 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:09,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -887793548, now seen corresponding path program 1 times [2025-03-08 21:35:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443527370] [2025-03-08 21:35:09,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:09,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 854 statements into 1 equivalence classes. [2025-03-08 21:35:09,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 854 of 854 statements. [2025-03-08 21:35:09,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:09,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:11,085 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:35:11,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:11,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443527370] [2025-03-08 21:35:11,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443527370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:11,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:11,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590676521] [2025-03-08 21:35:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:11,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:11,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:11,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1118 out of 1232 [2025-03-08 21:35:11,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1210 places, 1210 transitions, 2434 flow. Second operand has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 0 states have call successors, (0), 0 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:35:11,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:11,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1118 of 1232 [2025-03-08 21:35:11,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:14,258 INFO L124 PetriNetUnfolderBase]: 2177/9950 cut-off events. [2025-03-08 21:35:14,259 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-08 21:35:14,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14055 conditions, 9950 events. 2177/9950 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 80305 event pairs, 1832 based on Foata normal form. 0/8995 useless extension candidates. Maximal degree in co-relation 13198. Up to 4014 conditions per place. [2025-03-08 21:35:14,302 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 100 selfloop transitions, 5 changer transitions 0/1209 dead transitions. [2025-03-08 21:35:14,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1214 places, 1209 transitions, 2642 flow [2025-03-08 21:35:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:14,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6814 transitions. [2025-03-08 21:35:14,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218073593073594 [2025-03-08 21:35:14,312 INFO L175 Difference]: Start difference. First operand has 1210 places, 1210 transitions, 2434 flow. Second operand 6 states and 6814 transitions. [2025-03-08 21:35:14,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1214 places, 1209 transitions, 2642 flow [2025-03-08 21:35:14,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1209 transitions, 2632 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:14,324 INFO L231 Difference]: Finished difference. Result has 1209 places, 1209 transitions, 2432 flow [2025-03-08 21:35:14,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2422, PETRI_DIFFERENCE_MINUEND_PLACES=1204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2432, PETRI_PLACES=1209, PETRI_TRANSITIONS=1209} [2025-03-08 21:35:14,326 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-08 21:35:14,326 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1209 transitions, 2432 flow [2025-03-08 21:35:14,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 0 states have call successors, (0), 0 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:35:14,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:14,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:35:14,330 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:14,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1088119195, now seen corresponding path program 1 times [2025-03-08 21:35:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303399811] [2025-03-08 21:35:14,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:14,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 862 statements into 1 equivalence classes. [2025-03-08 21:35:14,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 862 of 862 statements. [2025-03-08 21:35:14,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:14,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:15,522 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:35:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303399811] [2025-03-08 21:35:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303399811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:15,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:15,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:15,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111870198] [2025-03-08 21:35:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:15,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:15,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:15,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:15,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1118 out of 1232 [2025-03-08 21:35:15,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1209 transitions, 2432 flow. Second operand has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 0 states have call successors, (0), 0 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:35:15,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:15,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1118 of 1232 [2025-03-08 21:35:15,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:18,114 INFO L124 PetriNetUnfolderBase]: 2177/9949 cut-off events. [2025-03-08 21:35:18,114 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-08 21:35:18,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14054 conditions, 9949 events. 2177/9949 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 80107 event pairs, 1832 based on Foata normal form. 0/8995 useless extension candidates. Maximal degree in co-relation 13189. Up to 4014 conditions per place. [2025-03-08 21:35:18,150 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 100 selfloop transitions, 5 changer transitions 0/1208 dead transitions. [2025-03-08 21:35:18,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1213 places, 1208 transitions, 2640 flow [2025-03-08 21:35:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6814 transitions. [2025-03-08 21:35:18,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218073593073594 [2025-03-08 21:35:18,160 INFO L175 Difference]: Start difference. First operand has 1209 places, 1209 transitions, 2432 flow. Second operand 6 states and 6814 transitions. [2025-03-08 21:35:18,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1213 places, 1208 transitions, 2640 flow [2025-03-08 21:35:18,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1208 transitions, 2630 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:18,175 INFO L231 Difference]: Finished difference. Result has 1208 places, 1208 transitions, 2430 flow [2025-03-08 21:35:18,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=1203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2430, PETRI_PLACES=1208, PETRI_TRANSITIONS=1208} [2025-03-08 21:35:18,177 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-08 21:35:18,177 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1208 transitions, 2430 flow [2025-03-08 21:35:18,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 0 states have call successors, (0), 0 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:35:18,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:18,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:18,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:35:18,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:18,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:18,182 INFO L85 PathProgramCache]: Analyzing trace with hash -509437694, now seen corresponding path program 1 times [2025-03-08 21:35:18,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:18,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40997477] [2025-03-08 21:35:18,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:18,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-03-08 21:35:18,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-03-08 21:35:18,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:18,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:19,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 21:35:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:19,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40997477] [2025-03-08 21:35:19,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40997477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:19,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:19,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:19,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890577493] [2025-03-08 21:35:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:19,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:19,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:19,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:20,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-08 21:35:20,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1208 transitions, 2430 flow. Second operand has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 0 states have call successors, (0), 0 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:35:20,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:20,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-08 21:35:20,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:21,349 INFO L124 PetriNetUnfolderBase]: 513/5691 cut-off events. [2025-03-08 21:35:21,350 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 21:35:21,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 5691 events. 513/5691 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 39264 event pairs, 344 based on Foata normal form. 0/5106 useless extension candidates. Maximal degree in co-relation 5689. Up to 822 conditions per place. [2025-03-08 21:35:21,370 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 54 selfloop transitions, 5 changer transitions 0/1207 dead transitions. [2025-03-08 21:35:21,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1207 transitions, 2546 flow [2025-03-08 21:35:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:21,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7044 transitions. [2025-03-08 21:35:21,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952922077922078 [2025-03-08 21:35:21,377 INFO L175 Difference]: Start difference. First operand has 1208 places, 1208 transitions, 2430 flow. Second operand 6 states and 7044 transitions. [2025-03-08 21:35:21,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1207 transitions, 2546 flow [2025-03-08 21:35:21,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1207 places, 1207 transitions, 2536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:21,389 INFO L231 Difference]: Finished difference. Result has 1207 places, 1207 transitions, 2428 flow [2025-03-08 21:35:21,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2418, PETRI_DIFFERENCE_MINUEND_PLACES=1202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2428, PETRI_PLACES=1207, PETRI_TRANSITIONS=1207} [2025-03-08 21:35:21,391 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -12 predicate places. [2025-03-08 21:35:21,391 INFO L471 AbstractCegarLoop]: Abstraction has has 1207 places, 1207 transitions, 2428 flow [2025-03-08 21:35:21,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 0 states have call successors, (0), 0 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:35:21,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:21,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:35:21,394 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 155403673, now seen corresponding path program 1 times [2025-03-08 21:35:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3457618] [2025-03-08 21:35:21,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:21,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-03-08 21:35:21,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-03-08 21:35:21,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:21,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 21:35:22,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3457618] [2025-03-08 21:35:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3457618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:22,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:22,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063649784] [2025-03-08 21:35:22,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:22,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:22,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:22,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:22,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:23,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-08 21:35:23,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1207 places, 1207 transitions, 2428 flow. Second operand has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 0 states have call successors, (0), 0 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:35:23,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:23,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-08 21:35:23,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:24,337 INFO L124 PetriNetUnfolderBase]: 513/5690 cut-off events. [2025-03-08 21:35:24,338 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-08 21:35:24,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 5690 events. 513/5690 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 39388 event pairs, 344 based on Foata normal form. 0/5106 useless extension candidates. Maximal degree in co-relation 5650. Up to 822 conditions per place. [2025-03-08 21:35:24,365 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 54 selfloop transitions, 5 changer transitions 0/1206 dead transitions. [2025-03-08 21:35:24,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1206 transitions, 2544 flow [2025-03-08 21:35:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7044 transitions. [2025-03-08 21:35:24,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952922077922078 [2025-03-08 21:35:24,372 INFO L175 Difference]: Start difference. First operand has 1207 places, 1207 transitions, 2428 flow. Second operand 6 states and 7044 transitions. [2025-03-08 21:35:24,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1206 transitions, 2544 flow [2025-03-08 21:35:24,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1206 places, 1206 transitions, 2534 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:24,385 INFO L231 Difference]: Finished difference. Result has 1206 places, 1206 transitions, 2426 flow [2025-03-08 21:35:24,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=1201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2426, PETRI_PLACES=1206, PETRI_TRANSITIONS=1206} [2025-03-08 21:35:24,388 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -13 predicate places. [2025-03-08 21:35:24,389 INFO L471 AbstractCegarLoop]: Abstraction has has 1206 places, 1206 transitions, 2426 flow [2025-03-08 21:35:24,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 0 states have call successors, (0), 0 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:35:24,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:24,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:35:24,391 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:24,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:24,393 INFO L85 PathProgramCache]: Analyzing trace with hash -693478345, now seen corresponding path program 1 times [2025-03-08 21:35:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:24,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048466868] [2025-03-08 21:35:24,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:24,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:24,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 903 statements into 1 equivalence classes. [2025-03-08 21:35:24,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 903 of 903 statements. [2025-03-08 21:35:24,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:24,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 21:35:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048466868] [2025-03-08 21:35:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048466868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:24,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058909016] [2025-03-08 21:35:24,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:24,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:24,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:24,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:24,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1211 out of 1232 [2025-03-08 21:35:24,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1206 places, 1206 transitions, 2426 flow. Second operand has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 0 states have call successors, (0), 0 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:35:24,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:24,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1211 of 1232 [2025-03-08 21:35:24,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:24,988 INFO L124 PetriNetUnfolderBase]: 53/1798 cut-off events. [2025-03-08 21:35:24,989 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 21:35:24,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1798 events. 53/1798 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4907 event pairs, 14 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 1006. Up to 56 conditions per place. [2025-03-08 21:35:24,998 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 17 selfloop transitions, 4 changer transitions 0/1214 dead transitions. [2025-03-08 21:35:24,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1208 places, 1214 transitions, 2487 flow [2025-03-08 21:35:24,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:25,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3655 transitions. [2025-03-08 21:35:25,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9889069264069265 [2025-03-08 21:35:25,004 INFO L175 Difference]: Start difference. First operand has 1206 places, 1206 transitions, 2426 flow. Second operand 3 states and 3655 transitions. [2025-03-08 21:35:25,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1208 places, 1214 transitions, 2487 flow [2025-03-08 21:35:25,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1203 places, 1214 transitions, 2477 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:25,027 INFO L231 Difference]: Finished difference. Result has 1205 places, 1209 transitions, 2446 flow [2025-03-08 21:35:25,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=1201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2446, PETRI_PLACES=1205, PETRI_TRANSITIONS=1209} [2025-03-08 21:35:25,031 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -14 predicate places. [2025-03-08 21:35:25,032 INFO L471 AbstractCegarLoop]: Abstraction has has 1205 places, 1209 transitions, 2446 flow [2025-03-08 21:35:25,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 0 states have call successors, (0), 0 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:35:25,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:25,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:35:25,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1468023787, now seen corresponding path program 1 times [2025-03-08 21:35:25,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:25,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958539922] [2025-03-08 21:35:25,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:25,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 908 statements into 1 equivalence classes. [2025-03-08 21:35:25,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 908 of 908 statements. [2025-03-08 21:35:25,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:25,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 21:35:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958539922] [2025-03-08 21:35:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958539922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:25,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:35:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918441684] [2025-03-08 21:35:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:25,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:25,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:25,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:25,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:25,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1211 out of 1232 [2025-03-08 21:35:25,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1205 places, 1209 transitions, 2446 flow. Second operand has 3 states, 3 states have (on average 1213.0) internal successors, (3639), 3 states have internal predecessors, (3639), 0 states have call successors, (0), 0 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:35:25,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:25,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1211 of 1232 [2025-03-08 21:35:25,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:25,870 INFO L124 PetriNetUnfolderBase]: 96/2861 cut-off events. [2025-03-08 21:35:25,870 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-08 21:35:25,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 2861 events. 96/2861 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13701 event pairs, 22 based on Foata normal form. 0/2638 useless extension candidates. Maximal degree in co-relation 1965. Up to 85 conditions per place. [2025-03-08 21:35:25,881 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 16 selfloop transitions, 4 changer transitions 0/1216 dead transitions. [2025-03-08 21:35:25,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1207 places, 1216 transitions, 2501 flow [2025-03-08 21:35:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3654 transitions. [2025-03-08 21:35:25,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9886363636363636 [2025-03-08 21:35:25,886 INFO L175 Difference]: Start difference. First operand has 1205 places, 1209 transitions, 2446 flow. Second operand 3 states and 3654 transitions. [2025-03-08 21:35:25,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1207 places, 1216 transitions, 2501 flow [2025-03-08 21:35:25,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1205 places, 1216 transitions, 2493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:25,902 INFO L231 Difference]: Finished difference. Result has 1207 places, 1212 transitions, 2468 flow [2025-03-08 21:35:25,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2438, PETRI_DIFFERENCE_MINUEND_PLACES=1203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2468, PETRI_PLACES=1207, PETRI_TRANSITIONS=1212} [2025-03-08 21:35:25,904 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -12 predicate places. [2025-03-08 21:35:25,904 INFO L471 AbstractCegarLoop]: Abstraction has has 1207 places, 1212 transitions, 2468 flow [2025-03-08 21:35:25,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1213.0) internal successors, (3639), 3 states have internal predecessors, (3639), 0 states have call successors, (0), 0 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:35:25,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:25,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:35:25,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:25,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:25,907 INFO L85 PathProgramCache]: Analyzing trace with hash -199966866, now seen corresponding path program 1 times [2025-03-08 21:35:25,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:25,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619735071] [2025-03-08 21:35:25,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:25,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:25,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 910 statements into 1 equivalence classes. [2025-03-08 21:35:25,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 910 of 910 statements. [2025-03-08 21:35:25,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:25,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619735071] [2025-03-08 21:35:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619735071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:26,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:26,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481123219] [2025-03-08 21:35:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:26,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:26,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:26,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:26,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:26,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1213 out of 1232 [2025-03-08 21:35:26,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1207 places, 1212 transitions, 2468 flow. Second operand has 3 states, 3 states have (on average 1214.6666666666667) internal successors, (3644), 3 states have internal predecessors, (3644), 0 states have call successors, (0), 0 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:35:26,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:26,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1213 of 1232 [2025-03-08 21:35:26,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:26,858 INFO L124 PetriNetUnfolderBase]: 81/2937 cut-off events. [2025-03-08 21:35:26,858 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 21:35:26,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 2937 events. 81/2937 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12370 event pairs, 33 based on Foata normal form. 7/2730 useless extension candidates. Maximal degree in co-relation 1934. Up to 103 conditions per place. [2025-03-08 21:35:26,875 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1216 dead transitions. [2025-03-08 21:35:26,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1209 places, 1216 transitions, 2508 flow [2025-03-08 21:35:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3655 transitions. [2025-03-08 21:35:26,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9889069264069265 [2025-03-08 21:35:26,880 INFO L175 Difference]: Start difference. First operand has 1207 places, 1212 transitions, 2468 flow. Second operand 3 states and 3655 transitions. [2025-03-08 21:35:26,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1209 places, 1216 transitions, 2508 flow [2025-03-08 21:35:26,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1207 places, 1216 transitions, 2500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:26,896 INFO L231 Difference]: Finished difference. Result has 1208 places, 1213 transitions, 2472 flow [2025-03-08 21:35:26,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2460, PETRI_DIFFERENCE_MINUEND_PLACES=1205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2472, PETRI_PLACES=1208, PETRI_TRANSITIONS=1213} [2025-03-08 21:35:26,898 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-08 21:35:26,898 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1213 transitions, 2472 flow [2025-03-08 21:35:26,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1214.6666666666667) internal successors, (3644), 3 states have internal predecessors, (3644), 0 states have call successors, (0), 0 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:35:26,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:26,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:26,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:35:26,900 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -980050692, now seen corresponding path program 1 times [2025-03-08 21:35:26,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:26,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442672684] [2025-03-08 21:35:26,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:26,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-03-08 21:35:26,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-03-08 21:35:26,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:26,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442672684] [2025-03-08 21:35:27,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442672684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:27,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:27,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:27,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940395729] [2025-03-08 21:35:27,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:27,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:27,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:27,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:27,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:27,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1213 out of 1232 [2025-03-08 21:35:27,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1213 transitions, 2472 flow. Second operand has 3 states, 3 states have (on average 1215.0) internal successors, (3645), 3 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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:35:27,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:27,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1213 of 1232 [2025-03-08 21:35:27,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:28,362 INFO L124 PetriNetUnfolderBase]: 136/4585 cut-off events. [2025-03-08 21:35:28,362 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 21:35:28,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 4585 events. 136/4585 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26317 event pairs, 40 based on Foata normal form. 9/4194 useless extension candidates. Maximal degree in co-relation 3630. Up to 113 conditions per place. [2025-03-08 21:35:28,395 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1217 dead transitions. [2025-03-08 21:35:28,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1210 places, 1217 transitions, 2511 flow [2025-03-08 21:35:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3655 transitions. [2025-03-08 21:35:28,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9889069264069265 [2025-03-08 21:35:28,401 INFO L175 Difference]: Start difference. First operand has 1208 places, 1213 transitions, 2472 flow. Second operand 3 states and 3655 transitions. [2025-03-08 21:35:28,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1210 places, 1217 transitions, 2511 flow [2025-03-08 21:35:28,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1217 transitions, 2509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:28,418 INFO L231 Difference]: Finished difference. Result has 1210 places, 1214 transitions, 2482 flow [2025-03-08 21:35:28,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2470, PETRI_DIFFERENCE_MINUEND_PLACES=1207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2482, PETRI_PLACES=1210, PETRI_TRANSITIONS=1214} [2025-03-08 21:35:28,420 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -9 predicate places. [2025-03-08 21:35:28,420 INFO L471 AbstractCegarLoop]: Abstraction has has 1210 places, 1214 transitions, 2482 flow [2025-03-08 21:35:28,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1215.0) internal successors, (3645), 3 states have internal predecessors, (3645), 0 states have call successors, (0), 0 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:35:28,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:28,422 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:28,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:35:28,422 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 519161698, now seen corresponding path program 1 times [2025-03-08 21:35:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217210682] [2025-03-08 21:35:28,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:28,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-08 21:35:28,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-08 21:35:28,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:28,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:28,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:28,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217210682] [2025-03-08 21:35:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217210682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:28,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:35:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497964003] [2025-03-08 21:35:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:28,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:28,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:28,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:28,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:35:28,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1212 out of 1232 [2025-03-08 21:35:28,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1210 places, 1214 transitions, 2482 flow. Second operand has 3 states, 3 states have (on average 1214.0) internal successors, (3642), 3 states have internal predecessors, (3642), 0 states have call successors, (0), 0 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:35:28,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:28,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1212 of 1232 [2025-03-08 21:35:28,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:29,758 INFO L124 PetriNetUnfolderBase]: 86/3627 cut-off events. [2025-03-08 21:35:29,759 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-08 21:35:29,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3800 conditions, 3627 events. 86/3627 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 17510 event pairs, 17 based on Foata normal form. 4/3343 useless extension candidates. Maximal degree in co-relation 2617. Up to 41 conditions per place. [2025-03-08 21:35:29,772 INFO L140 encePairwiseOnDemand]: 1228/1232 looper letters, 14 selfloop transitions, 3 changer transitions 0/1215 dead transitions. [2025-03-08 21:35:29,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1215 transitions, 2513 flow [2025-03-08 21:35:29,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3654 transitions. [2025-03-08 21:35:29,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9886363636363636 [2025-03-08 21:35:29,777 INFO L175 Difference]: Start difference. First operand has 1210 places, 1214 transitions, 2482 flow. Second operand 3 states and 3654 transitions. [2025-03-08 21:35:29,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1215 transitions, 2513 flow [2025-03-08 21:35:29,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1215 transitions, 2503 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-08 21:35:29,794 INFO L231 Difference]: Finished difference. Result has 1209 places, 1210 transitions, 2467 flow [2025-03-08 21:35:29,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=1206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2467, PETRI_PLACES=1209, PETRI_TRANSITIONS=1210} [2025-03-08 21:35:29,796 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-08 21:35:29,796 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1210 transitions, 2467 flow [2025-03-08 21:35:29,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1214.0) internal successors, (3642), 3 states have internal predecessors, (3642), 0 states have call successors, (0), 0 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:35:29,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:29,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:29,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:35:29,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:29,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash 184100842, now seen corresponding path program 1 times [2025-03-08 21:35:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:29,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667407421] [2025-03-08 21:35:29,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:29,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-08 21:35:29,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-08 21:35:29,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:29,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:31,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667407421] [2025-03-08 21:35:31,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667407421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:31,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:31,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:31,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203959412] [2025-03-08 21:35:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:31,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:31,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:31,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:31,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1154 out of 1232 [2025-03-08 21:35:31,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1210 transitions, 2467 flow. Second operand has 6 states, 6 states have (on average 1157.5) internal successors, (6945), 6 states have internal predecessors, (6945), 0 states have call successors, (0), 0 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:35:31,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:31,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1154 of 1232 [2025-03-08 21:35:31,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:32,162 INFO L124 PetriNetUnfolderBase]: 387/3658 cut-off events. [2025-03-08 21:35:32,162 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-08 21:35:32,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4703 conditions, 3658 events. 387/3658 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 17360 event pairs, 244 based on Foata normal form. 0/3420 useless extension candidates. Maximal degree in co-relation 3161. Up to 603 conditions per place. [2025-03-08 21:35:32,173 INFO L140 encePairwiseOnDemand]: 1218/1232 looper letters, 68 selfloop transitions, 11 changer transitions 0/1219 dead transitions. [2025-03-08 21:35:32,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1219 transitions, 2651 flow [2025-03-08 21:35:32,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:32,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7006 transitions. [2025-03-08 21:35:32,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477813852813853 [2025-03-08 21:35:32,179 INFO L175 Difference]: Start difference. First operand has 1209 places, 1210 transitions, 2467 flow. Second operand 6 states and 7006 transitions. [2025-03-08 21:35:32,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1219 transitions, 2651 flow [2025-03-08 21:35:32,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1219 transitions, 2645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:32,190 INFO L231 Difference]: Finished difference. Result has 1209 places, 1207 transitions, 2477 flow [2025-03-08 21:35:32,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=1204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2477, PETRI_PLACES=1209, PETRI_TRANSITIONS=1207} [2025-03-08 21:35:32,192 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-08 21:35:32,192 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1207 transitions, 2477 flow [2025-03-08 21:35:32,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1157.5) internal successors, (6945), 6 states have internal predecessors, (6945), 0 states have call successors, (0), 0 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:35:32,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:32,194 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:32,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 21:35:32,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:32,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 28383803, now seen corresponding path program 1 times [2025-03-08 21:35:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628082276] [2025-03-08 21:35:32,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:32,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:32,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 928 statements into 1 equivalence classes. [2025-03-08 21:35:32,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 928 of 928 statements. [2025-03-08 21:35:32,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:32,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:33,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:33,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628082276] [2025-03-08 21:35:33,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628082276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:33,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:33,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:33,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324482343] [2025-03-08 21:35:33,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:33,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:33,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:33,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:33,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:33,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1108 out of 1232 [2025-03-08 21:35:33,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1207 transitions, 2477 flow. Second operand has 6 states, 6 states have (on average 1113.8333333333333) internal successors, (6683), 6 states have internal predecessors, (6683), 0 states have call successors, (0), 0 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:35:33,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:33,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1108 of 1232 [2025-03-08 21:35:33,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:34,546 INFO L124 PetriNetUnfolderBase]: 693/4197 cut-off events. [2025-03-08 21:35:34,546 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-08 21:35:34,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6105 conditions, 4197 events. 693/4197 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 23963 event pairs, 604 based on Foata normal form. 0/3934 useless extension candidates. Maximal degree in co-relation 4457. Up to 1497 conditions per place. [2025-03-08 21:35:34,560 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 122 selfloop transitions, 5 changer transitions 0/1218 dead transitions. [2025-03-08 21:35:34,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1213 places, 1218 transitions, 2761 flow [2025-03-08 21:35:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6776 transitions. [2025-03-08 21:35:34,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-03-08 21:35:34,564 INFO L175 Difference]: Start difference. First operand has 1209 places, 1207 transitions, 2477 flow. Second operand 6 states and 6776 transitions. [2025-03-08 21:35:34,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1213 places, 1218 transitions, 2761 flow [2025-03-08 21:35:34,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1218 transitions, 2739 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:34,575 INFO L231 Difference]: Finished difference. Result has 1208 places, 1206 transitions, 2463 flow [2025-03-08 21:35:34,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=1203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2463, PETRI_PLACES=1208, PETRI_TRANSITIONS=1206} [2025-03-08 21:35:34,577 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-08 21:35:34,577 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1206 transitions, 2463 flow [2025-03-08 21:35:34,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1113.8333333333333) internal successors, (6683), 6 states have internal predecessors, (6683), 0 states have call successors, (0), 0 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:35:34,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:34,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:35:34,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:34,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash 320195647, now seen corresponding path program 1 times [2025-03-08 21:35:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029298385] [2025-03-08 21:35:34,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:34,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 936 statements into 1 equivalence classes. [2025-03-08 21:35:34,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 936 of 936 statements. [2025-03-08 21:35:34,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:34,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:35,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:35,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029298385] [2025-03-08 21:35:35,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029298385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:35,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:35,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839422538] [2025-03-08 21:35:35,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:35,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:35,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:35,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:36,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1232 [2025-03-08 21:35:36,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1206 transitions, 2463 flow. Second operand has 6 states, 6 states have (on average 1175.1666666666667) internal successors, (7051), 6 states have internal predecessors, (7051), 0 states have call successors, (0), 0 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:35:36,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:36,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1232 [2025-03-08 21:35:36,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:36,930 INFO L124 PetriNetUnfolderBase]: 297/3552 cut-off events. [2025-03-08 21:35:36,930 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-08 21:35:36,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4356 conditions, 3552 events. 297/3552 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 16326 event pairs, 214 based on Foata normal form. 0/3322 useless extension candidates. Maximal degree in co-relation 2960. Up to 533 conditions per place. [2025-03-08 21:35:36,941 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 59 selfloop transitions, 5 changer transitions 0/1217 dead transitions. [2025-03-08 21:35:36,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1217 transitions, 2621 flow [2025-03-08 21:35:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:36,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:36,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7091 transitions. [2025-03-08 21:35:36,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959280303030303 [2025-03-08 21:35:36,944 INFO L175 Difference]: Start difference. First operand has 1208 places, 1206 transitions, 2463 flow. Second operand 6 states and 7091 transitions. [2025-03-08 21:35:36,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1217 transitions, 2621 flow [2025-03-08 21:35:36,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1207 places, 1217 transitions, 2611 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:36,954 INFO L231 Difference]: Finished difference. Result has 1207 places, 1205 transitions, 2461 flow [2025-03-08 21:35:36,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=1202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2461, PETRI_PLACES=1207, PETRI_TRANSITIONS=1205} [2025-03-08 21:35:36,956 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -12 predicate places. [2025-03-08 21:35:36,956 INFO L471 AbstractCegarLoop]: Abstraction has has 1207 places, 1205 transitions, 2461 flow [2025-03-08 21:35:36,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1175.1666666666667) internal successors, (7051), 6 states have internal predecessors, (7051), 0 states have call successors, (0), 0 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:35:36,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:36,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:36,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 21:35:36,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:36,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash -107245885, now seen corresponding path program 1 times [2025-03-08 21:35:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:36,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494237459] [2025-03-08 21:35:36,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:36,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 944 statements into 1 equivalence classes. [2025-03-08 21:35:37,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 944 of 944 statements. [2025-03-08 21:35:37,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:37,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:38,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:38,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494237459] [2025-03-08 21:35:38,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494237459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:38,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:38,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:38,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463221893] [2025-03-08 21:35:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:38,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:38,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:38,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:38,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1129 out of 1232 [2025-03-08 21:35:38,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1207 places, 1205 transitions, 2461 flow. Second operand has 6 states, 6 states have (on average 1135.5) internal successors, (6813), 6 states have internal predecessors, (6813), 0 states have call successors, (0), 0 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:35:38,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:38,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1129 of 1232 [2025-03-08 21:35:38,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:39,349 INFO L124 PetriNetUnfolderBase]: 567/4055 cut-off events. [2025-03-08 21:35:39,349 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-08 21:35:39,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 4055 events. 567/4055 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 22548 event pairs, 478 based on Foata normal form. 0/3808 useless extension candidates. Maximal degree in co-relation 4115. Up to 1203 conditions per place. [2025-03-08 21:35:39,362 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 101 selfloop transitions, 5 changer transitions 0/1216 dead transitions. [2025-03-08 21:35:39,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1216 transitions, 2703 flow [2025-03-08 21:35:39,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6881 transitions. [2025-03-08 21:35:39,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9308712121212122 [2025-03-08 21:35:39,366 INFO L175 Difference]: Start difference. First operand has 1207 places, 1205 transitions, 2461 flow. Second operand 6 states and 6881 transitions. [2025-03-08 21:35:39,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1216 transitions, 2703 flow [2025-03-08 21:35:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1206 places, 1216 transitions, 2693 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:39,377 INFO L231 Difference]: Finished difference. Result has 1206 places, 1204 transitions, 2459 flow [2025-03-08 21:35:39,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=1201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2459, PETRI_PLACES=1206, PETRI_TRANSITIONS=1204} [2025-03-08 21:35:39,378 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -13 predicate places. [2025-03-08 21:35:39,378 INFO L471 AbstractCegarLoop]: Abstraction has has 1206 places, 1204 transitions, 2459 flow [2025-03-08 21:35:39,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1135.5) internal successors, (6813), 6 states have internal predecessors, (6813), 0 states have call successors, (0), 0 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:35:39,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:39,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:35:39,380 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:39,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash 15389586, now seen corresponding path program 1 times [2025-03-08 21:35:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521055169] [2025-03-08 21:35:39,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:39,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:39,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 962 statements into 1 equivalence classes. [2025-03-08 21:35:39,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 962 of 962 statements. [2025-03-08 21:35:39,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:39,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 21:35:40,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521055169] [2025-03-08 21:35:40,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521055169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:40,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:40,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270958452] [2025-03-08 21:35:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:40,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:40,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:40,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:40,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1114 out of 1232 [2025-03-08 21:35:40,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1206 places, 1204 transitions, 2459 flow. Second operand has 6 states, 6 states have (on average 1121.3333333333333) internal successors, (6728), 6 states have internal predecessors, (6728), 0 states have call successors, (0), 0 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:35:40,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:40,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1114 of 1232 [2025-03-08 21:35:40,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:41,606 INFO L124 PetriNetUnfolderBase]: 657/4137 cut-off events. [2025-03-08 21:35:41,606 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-08 21:35:41,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5889 conditions, 4137 events. 657/4137 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23488 event pairs, 568 based on Foata normal form. 0/3906 useless extension candidates. Maximal degree in co-relation 4319. Up to 1413 conditions per place. [2025-03-08 21:35:41,619 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 116 selfloop transitions, 5 changer transitions 0/1215 dead transitions. [2025-03-08 21:35:41,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1210 places, 1215 transitions, 2731 flow [2025-03-08 21:35:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6806 transitions. [2025-03-08 21:35:41,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207251082251082 [2025-03-08 21:35:41,623 INFO L175 Difference]: Start difference. First operand has 1206 places, 1204 transitions, 2459 flow. Second operand 6 states and 6806 transitions. [2025-03-08 21:35:41,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1210 places, 1215 transitions, 2731 flow [2025-03-08 21:35:41,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1205 places, 1215 transitions, 2721 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:41,633 INFO L231 Difference]: Finished difference. Result has 1205 places, 1203 transitions, 2457 flow [2025-03-08 21:35:41,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=1200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2457, PETRI_PLACES=1205, PETRI_TRANSITIONS=1203} [2025-03-08 21:35:41,635 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -14 predicate places. [2025-03-08 21:35:41,635 INFO L471 AbstractCegarLoop]: Abstraction has has 1205 places, 1203 transitions, 2457 flow [2025-03-08 21:35:41,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1121.3333333333333) internal successors, (6728), 6 states have internal predecessors, (6728), 0 states have call successors, (0), 0 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:35:41,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:41,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 21:35:41,636 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:41,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:41,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1839927053, now seen corresponding path program 1 times [2025-03-08 21:35:41,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:41,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100435877] [2025-03-08 21:35:41,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:41,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:41,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 969 statements into 1 equivalence classes. [2025-03-08 21:35:41,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 969 of 969 statements. [2025-03-08 21:35:41,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:41,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 21:35:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:42,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100435877] [2025-03-08 21:35:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100435877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:42,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:42,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:42,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297780436] [2025-03-08 21:35:42,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:42,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:42,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:43,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1114 out of 1232 [2025-03-08 21:35:43,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1205 places, 1203 transitions, 2457 flow. Second operand has 6 states, 6 states have (on average 1122.1666666666667) internal successors, (6733), 6 states have internal predecessors, (6733), 0 states have call successors, (0), 0 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:35:43,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:43,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1114 of 1232 [2025-03-08 21:35:43,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:44,003 INFO L124 PetriNetUnfolderBase]: 651/4123 cut-off events. [2025-03-08 21:35:44,004 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-08 21:35:44,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5865 conditions, 4123 events. 651/4123 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23215 event pairs, 562 based on Foata normal form. 0/3892 useless extension candidates. Maximal degree in co-relation 4305. Up to 1407 conditions per place. [2025-03-08 21:35:44,016 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 116 selfloop transitions, 5 changer transitions 0/1214 dead transitions. [2025-03-08 21:35:44,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1209 places, 1214 transitions, 2729 flow [2025-03-08 21:35:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6806 transitions. [2025-03-08 21:35:44,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207251082251082 [2025-03-08 21:35:44,020 INFO L175 Difference]: Start difference. First operand has 1205 places, 1203 transitions, 2457 flow. Second operand 6 states and 6806 transitions. [2025-03-08 21:35:44,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1209 places, 1214 transitions, 2729 flow [2025-03-08 21:35:44,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1204 places, 1214 transitions, 2719 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:44,031 INFO L231 Difference]: Finished difference. Result has 1204 places, 1202 transitions, 2455 flow [2025-03-08 21:35:44,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2445, PETRI_DIFFERENCE_MINUEND_PLACES=1199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2455, PETRI_PLACES=1204, PETRI_TRANSITIONS=1202} [2025-03-08 21:35:44,032 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -15 predicate places. [2025-03-08 21:35:44,032 INFO L471 AbstractCegarLoop]: Abstraction has has 1204 places, 1202 transitions, 2455 flow [2025-03-08 21:35:44,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1122.1666666666667) internal successors, (6733), 6 states have internal predecessors, (6733), 0 states have call successors, (0), 0 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:35:44,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:44,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:44,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:35:44,034 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:44,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1501437567, now seen corresponding path program 1 times [2025-03-08 21:35:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641759680] [2025-03-08 21:35:44,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:44,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 976 statements into 1 equivalence classes. [2025-03-08 21:35:44,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 976 of 976 statements. [2025-03-08 21:35:44,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:44,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 21:35:45,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:45,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641759680] [2025-03-08 21:35:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641759680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:45,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629609457] [2025-03-08 21:35:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:45,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:45,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:45,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:46,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1109 out of 1232 [2025-03-08 21:35:46,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1204 places, 1202 transitions, 2455 flow. Second operand has 6 states, 6 states have (on average 1118.1666666666667) internal successors, (6709), 6 states have internal predecessors, (6709), 0 states have call successors, (0), 0 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:35:46,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:46,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1109 of 1232 [2025-03-08 21:35:46,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:47,560 INFO L124 PetriNetUnfolderBase]: 672/4139 cut-off events. [2025-03-08 21:35:47,560 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-08 21:35:47,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5941 conditions, 4139 events. 672/4139 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 23348 event pairs, 583 based on Foata normal form. 0/3914 useless extension candidates. Maximal degree in co-relation 5734. Up to 1453 conditions per place. [2025-03-08 21:35:47,574 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 122 selfloop transitions, 5 changer transitions 0/1213 dead transitions. [2025-03-08 21:35:47,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1208 places, 1213 transitions, 2739 flow [2025-03-08 21:35:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6781 transitions. [2025-03-08 21:35:47,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173430735930735 [2025-03-08 21:35:47,578 INFO L175 Difference]: Start difference. First operand has 1204 places, 1202 transitions, 2455 flow. Second operand 6 states and 6781 transitions. [2025-03-08 21:35:47,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1208 places, 1213 transitions, 2739 flow [2025-03-08 21:35:47,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1203 places, 1213 transitions, 2729 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:47,589 INFO L231 Difference]: Finished difference. Result has 1203 places, 1201 transitions, 2453 flow [2025-03-08 21:35:47,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=1198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2453, PETRI_PLACES=1203, PETRI_TRANSITIONS=1201} [2025-03-08 21:35:47,591 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -16 predicate places. [2025-03-08 21:35:47,591 INFO L471 AbstractCegarLoop]: Abstraction has has 1203 places, 1201 transitions, 2453 flow [2025-03-08 21:35:47,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1118.1666666666667) internal successors, (6709), 6 states have internal predecessors, (6709), 0 states have call successors, (0), 0 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:35:47,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:47,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:47,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:35:47,592 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:47,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash 552623750, now seen corresponding path program 1 times [2025-03-08 21:35:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:47,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074201154] [2025-03-08 21:35:47,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:47,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 985 statements into 1 equivalence classes. [2025-03-08 21:35:47,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 985 of 985 statements. [2025-03-08 21:35:47,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:47,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 21:35:47,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:47,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074201154] [2025-03-08 21:35:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074201154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:35:47,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598544112] [2025-03-08 21:35:47,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:47,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:47,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:47,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:35:47,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:35:48,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 985 statements into 1 equivalence classes. [2025-03-08 21:35:48,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 985 of 985 statements. [2025-03-08 21:35:48,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:48,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 2145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:35:48,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:35:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 21:35:48,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:35:48,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598544112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:48,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:35:48,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:35:48,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970418533] [2025-03-08 21:35:48,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:48,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:48,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:48,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:48,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:48,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-08 21:35:48,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1203 places, 1201 transitions, 2453 flow. Second operand has 3 states, 3 states have (on average 1211.3333333333333) internal successors, (3634), 3 states have internal predecessors, (3634), 0 states have call successors, (0), 0 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:35:48,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:48,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-08 21:35:48,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:48,594 INFO L124 PetriNetUnfolderBase]: 64/2448 cut-off events. [2025-03-08 21:35:48,594 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 21:35:48,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 2448 events. 64/2448 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7498 event pairs, 29 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 2023. Up to 79 conditions per place. [2025-03-08 21:35:48,601 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 15 selfloop transitions, 2 changer transitions 0/1203 dead transitions. [2025-03-08 21:35:48,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1204 places, 1203 transitions, 2493 flow [2025-03-08 21:35:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3645 transitions. [2025-03-08 21:35:48,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9862012987012987 [2025-03-08 21:35:48,603 INFO L175 Difference]: Start difference. First operand has 1203 places, 1201 transitions, 2453 flow. Second operand 3 states and 3645 transitions. [2025-03-08 21:35:48,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1204 places, 1203 transitions, 2493 flow [2025-03-08 21:35:48,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1199 places, 1203 transitions, 2483 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:48,613 INFO L231 Difference]: Finished difference. Result has 1199 places, 1200 transitions, 2445 flow [2025-03-08 21:35:48,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=1197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2445, PETRI_PLACES=1199, PETRI_TRANSITIONS=1200} [2025-03-08 21:35:48,614 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -20 predicate places. [2025-03-08 21:35:48,614 INFO L471 AbstractCegarLoop]: Abstraction has has 1199 places, 1200 transitions, 2445 flow [2025-03-08 21:35:48,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1211.3333333333333) internal successors, (3634), 3 states have internal predecessors, (3634), 0 states have call successors, (0), 0 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:35:48,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:48,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:48,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:35:48,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:48,816 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:48,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash -833266834, now seen corresponding path program 1 times [2025-03-08 21:35:48,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:48,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861381889] [2025-03-08 21:35:48,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:48,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:48,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 990 statements into 1 equivalence classes. [2025-03-08 21:35:48,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 990 of 990 statements. [2025-03-08 21:35:48,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:48,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 21:35:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861381889] [2025-03-08 21:35:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861381889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:35:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875639369] [2025-03-08 21:35:49,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:49,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:49,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:35:49,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:35:49,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 990 statements into 1 equivalence classes. [2025-03-08 21:35:49,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 990 of 990 statements. [2025-03-08 21:35:49,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:49,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:49,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 2153 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:35:49,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:35:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 21:35:49,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:35:49,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875639369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:49,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:35:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:35:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565227781] [2025-03-08 21:35:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:49,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:49,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:49,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:49,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-08 21:35:49,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1199 places, 1200 transitions, 2445 flow. Second operand has 3 states, 3 states have (on average 1211.0) internal successors, (3633), 3 states have internal predecessors, (3633), 0 states have call successors, (0), 0 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:35:49,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:49,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-08 21:35:49,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:50,075 INFO L124 PetriNetUnfolderBase]: 136/4130 cut-off events. [2025-03-08 21:35:50,075 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2025-03-08 21:35:50,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4429 conditions, 4130 events. 136/4130 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22230 event pairs, 38 based on Foata normal form. 1/3876 useless extension candidates. Maximal degree in co-relation 3252. Up to 129 conditions per place. [2025-03-08 21:35:50,089 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 17 selfloop transitions, 7 changer transitions 1/1208 dead transitions. [2025-03-08 21:35:50,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 1208 transitions, 2519 flow [2025-03-08 21:35:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3650 transitions. [2025-03-08 21:35:50,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9875541125541125 [2025-03-08 21:35:50,092 INFO L175 Difference]: Start difference. First operand has 1199 places, 1200 transitions, 2445 flow. Second operand 3 states and 3650 transitions. [2025-03-08 21:35:50,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1201 places, 1208 transitions, 2519 flow [2025-03-08 21:35:50,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1199 places, 1208 transitions, 2515 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:35:50,104 INFO L231 Difference]: Finished difference. Result has 1201 places, 1205 transitions, 2497 flow [2025-03-08 21:35:50,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=1197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2497, PETRI_PLACES=1201, PETRI_TRANSITIONS=1205} [2025-03-08 21:35:50,105 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -18 predicate places. [2025-03-08 21:35:50,106 INFO L471 AbstractCegarLoop]: Abstraction has has 1201 places, 1205 transitions, 2497 flow [2025-03-08 21:35:50,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1211.0) internal successors, (3633), 3 states have internal predecessors, (3633), 0 states have call successors, (0), 0 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:35:50,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:50,107 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:50,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 21:35:50,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 21:35:50,307 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:50,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:50,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1954362940, now seen corresponding path program 1 times [2025-03-08 21:35:50,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:50,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336175403] [2025-03-08 21:35:50,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:50,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:50,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1001 statements into 1 equivalence classes. [2025-03-08 21:35:50,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1001 of 1001 statements. [2025-03-08 21:35:50,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:50,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 21:35:50,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336175403] [2025-03-08 21:35:50,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336175403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:35:50,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661315434] [2025-03-08 21:35:50,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:50,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:50,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:50,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:35:50,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:35:50,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1001 statements into 1 equivalence classes. [2025-03-08 21:35:50,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1001 of 1001 statements. [2025-03-08 21:35:50,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:50,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:50,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 2187 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:35:50,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:35:50,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 21:35:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 21:35:50,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:35:50,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661315434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:50,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:35:50,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 21:35:50,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586145975] [2025-03-08 21:35:50,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:50,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:35:50,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:50,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:35:50,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:50,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1215 out of 1232 [2025-03-08 21:35:50,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1201 places, 1205 transitions, 2497 flow. Second operand has 3 states, 3 states have (on average 1217.0) internal successors, (3651), 3 states have internal predecessors, (3651), 0 states have call successors, (0), 0 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:35:50,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:50,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1215 of 1232 [2025-03-08 21:35:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:51,325 INFO L124 PetriNetUnfolderBase]: 33/2188 cut-off events. [2025-03-08 21:35:51,326 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-08 21:35:51,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 2188 events. 33/2188 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5274 event pairs, 6 based on Foata normal form. 2/2116 useless extension candidates. Maximal degree in co-relation 1697. Up to 26 conditions per place. [2025-03-08 21:35:51,331 INFO L140 encePairwiseOnDemand]: 1228/1232 looper letters, 7 selfloop transitions, 3 changer transitions 5/1198 dead transitions. [2025-03-08 21:35:51,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 1198 transitions, 2474 flow [2025-03-08 21:35:51,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:35:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:35:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3658 transitions. [2025-03-08 21:35:51,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9897186147186147 [2025-03-08 21:35:51,333 INFO L175 Difference]: Start difference. First operand has 1201 places, 1205 transitions, 2497 flow. Second operand 3 states and 3658 transitions. [2025-03-08 21:35:51,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1201 places, 1198 transitions, 2474 flow [2025-03-08 21:35:51,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1197 places, 1198 transitions, 2454 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-08 21:35:51,343 INFO L231 Difference]: Finished difference. Result has 1197 places, 1191 transitions, 2419 flow [2025-03-08 21:35:51,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=1195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2419, PETRI_PLACES=1197, PETRI_TRANSITIONS=1191} [2025-03-08 21:35:51,344 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -22 predicate places. [2025-03-08 21:35:51,344 INFO L471 AbstractCegarLoop]: Abstraction has has 1197 places, 1191 transitions, 2419 flow [2025-03-08 21:35:51,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1217.0) internal successors, (3651), 3 states have internal predecessors, (3651), 0 states have call successors, (0), 0 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:35:51,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:51,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:51,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 21:35:51,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:51,546 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:51,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:51,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1560316496, now seen corresponding path program 1 times [2025-03-08 21:35:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137406780] [2025-03-08 21:35:51,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:51,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1017 statements into 1 equivalence classes. [2025-03-08 21:35:51,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1017 of 1017 statements. [2025-03-08 21:35:51,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:51,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 21:35:51,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137406780] [2025-03-08 21:35:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137406780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:35:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96807474] [2025-03-08 21:35:51,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:51,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:51,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:51,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:35:51,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:35:52,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1017 statements into 1 equivalence classes. [2025-03-08 21:35:52,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1017 of 1017 statements. [2025-03-08 21:35:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:52,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:52,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 2230 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:35:52,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:35:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 21:35:52,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:35:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 21:35:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96807474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:35:52,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:35:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:35:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077781508] [2025-03-08 21:35:52,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:35:52,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:35:52,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:52,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:35:52,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:35:52,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-08 21:35:52,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1197 places, 1191 transitions, 2419 flow. Second operand has 10 states, 10 states have (on average 1212.2) internal successors, (12122), 10 states have internal predecessors, (12122), 0 states have call successors, (0), 0 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:35:52,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:52,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-08 21:35:52,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:52,892 INFO L124 PetriNetUnfolderBase]: 44/2159 cut-off events. [2025-03-08 21:35:52,892 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 21:35:52,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 2159 events. 44/2159 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3400 event pairs, 10 based on Foata normal form. 4/2086 useless extension candidates. Maximal degree in co-relation 1726. Up to 35 conditions per place. [2025-03-08 21:35:52,896 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 20 selfloop transitions, 9 changer transitions 0/1206 dead transitions. [2025-03-08 21:35:52,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 1206 transitions, 2523 flow [2025-03-08 21:35:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:35:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:35:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10921 transitions. [2025-03-08 21:35:52,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9849386724386724 [2025-03-08 21:35:52,901 INFO L175 Difference]: Start difference. First operand has 1197 places, 1191 transitions, 2419 flow. Second operand 9 states and 10921 transitions. [2025-03-08 21:35:52,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1201 places, 1206 transitions, 2523 flow [2025-03-08 21:35:52,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1198 places, 1206 transitions, 2514 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-08 21:35:52,911 INFO L231 Difference]: Finished difference. Result has 1201 places, 1197 transitions, 2460 flow [2025-03-08 21:35:52,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=1190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2460, PETRI_PLACES=1201, PETRI_TRANSITIONS=1197} [2025-03-08 21:35:52,912 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -18 predicate places. [2025-03-08 21:35:52,912 INFO L471 AbstractCegarLoop]: Abstraction has has 1201 places, 1197 transitions, 2460 flow [2025-03-08 21:35:52,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1212.2) internal successors, (12122), 10 states have internal predecessors, (12122), 0 states have call successors, (0), 0 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:35:52,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:52,914 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:52,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 21:35:53,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:53,115 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1850240272, now seen corresponding path program 2 times [2025-03-08 21:35:53,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:53,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58208985] [2025-03-08 21:35:53,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:35:53,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:53,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1167 statements into 2 equivalence classes. [2025-03-08 21:35:53,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 905 of 1167 statements. [2025-03-08 21:35:53,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:35:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:54,256 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2025-03-08 21:35:54,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58208985] [2025-03-08 21:35:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58208985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054210332] [2025-03-08 21:35:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:54,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:54,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:54,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:54,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-08 21:35:54,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1201 places, 1197 transitions, 2460 flow. Second operand has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 0 states have call successors, (0), 0 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:35:54,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:54,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-08 21:35:54,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:55,033 INFO L124 PetriNetUnfolderBase]: 130/2237 cut-off events. [2025-03-08 21:35:55,033 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-08 21:35:55,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 2237 events. 130/2237 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4498 event pairs, 95 based on Foata normal form. 0/2165 useless extension candidates. Maximal degree in co-relation 2026. Up to 303 conditions per place. [2025-03-08 21:35:55,037 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 57 selfloop transitions, 5 changer transitions 0/1200 dead transitions. [2025-03-08 21:35:55,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1205 places, 1200 transitions, 2594 flow [2025-03-08 21:35:55,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:35:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:35:55,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7047 transitions. [2025-03-08 21:35:55,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953327922077922 [2025-03-08 21:35:55,040 INFO L175 Difference]: Start difference. First operand has 1201 places, 1197 transitions, 2460 flow. Second operand 6 states and 7047 transitions. [2025-03-08 21:35:55,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1205 places, 1200 transitions, 2594 flow [2025-03-08 21:35:55,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1204 places, 1200 transitions, 2588 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 21:35:55,049 INFO L231 Difference]: Finished difference. Result has 1204 places, 1196 transitions, 2462 flow [2025-03-08 21:35:55,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2452, PETRI_DIFFERENCE_MINUEND_PLACES=1199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2462, PETRI_PLACES=1204, PETRI_TRANSITIONS=1196} [2025-03-08 21:35:55,051 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -15 predicate places. [2025-03-08 21:35:55,051 INFO L471 AbstractCegarLoop]: Abstraction has has 1204 places, 1196 transitions, 2462 flow [2025-03-08 21:35:55,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 0 states have call successors, (0), 0 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:35:55,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:55,053 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 21:35:55,053 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:55,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -985554477, now seen corresponding path program 1 times [2025-03-08 21:35:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:55,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523659469] [2025-03-08 21:35:55,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:55,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:55,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1173 statements into 1 equivalence classes. [2025-03-08 21:35:55,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1173 of 1173 statements. [2025-03-08 21:35:55,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:55,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:55,956 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 21:35:55,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523659469] [2025-03-08 21:35:55,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523659469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:35:55,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692042070] [2025-03-08 21:35:55,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:35:55,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:35:55,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:35:55,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:35:55,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:35:56,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1173 statements into 1 equivalence classes. [2025-03-08 21:35:56,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1173 of 1173 statements. [2025-03-08 21:35:56,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:35:56,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:56,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:35:56,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:35:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 21:35:56,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:35:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 21:35:56,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692042070] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:35:56,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:35:56,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:35:56,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614874980] [2025-03-08 21:35:56,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:35:56,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:35:56,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:56,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:35:56,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:35:56,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-08 21:35:56,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1204 places, 1196 transitions, 2462 flow. Second operand has 18 states, 18 states have (on average 1212.111111111111) internal successors, (21818), 18 states have internal predecessors, (21818), 0 states have call successors, (0), 0 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:35:56,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:56,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-08 21:35:56,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:35:57,500 INFO L124 PetriNetUnfolderBase]: 70/2923 cut-off events. [2025-03-08 21:35:57,500 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-08 21:35:57,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 2923 events. 70/2923 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4847 event pairs, 10 based on Foata normal form. 8/2850 useless extension candidates. Maximal degree in co-relation 2657. Up to 35 conditions per place. [2025-03-08 21:35:57,505 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 36 selfloop transitions, 21 changer transitions 0/1233 dead transitions. [2025-03-08 21:35:57,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1224 places, 1233 transitions, 2740 flow [2025-03-08 21:35:57,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:35:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:35:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25471 transitions. [2025-03-08 21:35:57,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9845006184291899 [2025-03-08 21:35:57,512 INFO L175 Difference]: Start difference. First operand has 1204 places, 1196 transitions, 2462 flow. Second operand 21 states and 25471 transitions. [2025-03-08 21:35:57,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1224 places, 1233 transitions, 2740 flow [2025-03-08 21:35:57,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1219 places, 1233 transitions, 2730 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:35:57,523 INFO L231 Difference]: Finished difference. Result has 1224 places, 1209 transitions, 2582 flow [2025-03-08 21:35:57,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2452, PETRI_DIFFERENCE_MINUEND_PLACES=1199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2582, PETRI_PLACES=1224, PETRI_TRANSITIONS=1209} [2025-03-08 21:35:57,524 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 5 predicate places. [2025-03-08 21:35:57,524 INFO L471 AbstractCegarLoop]: Abstraction has has 1224 places, 1209 transitions, 2582 flow [2025-03-08 21:35:57,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1212.111111111111) internal successors, (21818), 18 states have internal predecessors, (21818), 0 states have call successors, (0), 0 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:35:57,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:35:57,531 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:57,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 21:35:57,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 21:35:57,732 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:35:57,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:35:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1594889995, now seen corresponding path program 2 times [2025-03-08 21:35:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:35:57,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085174813] [2025-03-08 21:35:57,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:35:57,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:35:57,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1473 statements into 2 equivalence classes. [2025-03-08 21:35:57,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 911 of 1473 statements. [2025-03-08 21:35:57,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:35:57,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:35:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2025-03-08 21:35:59,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:35:59,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085174813] [2025-03-08 21:35:59,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085174813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:35:59,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:35:59,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:35:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895309006] [2025-03-08 21:35:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:35:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:35:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:35:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:35:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:35:59,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-08 21:35:59,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1224 places, 1209 transitions, 2582 flow. Second operand has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 0 states have call successors, (0), 0 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:35:59,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:35:59,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-08 21:35:59,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:00,193 INFO L124 PetriNetUnfolderBase]: 218/3065 cut-off events. [2025-03-08 21:36:00,193 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-08 21:36:00,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4122 conditions, 3065 events. 218/3065 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 6805 event pairs, 175 based on Foata normal form. 0/2989 useless extension candidates. Maximal degree in co-relation 3374. Up to 543 conditions per place. [2025-03-08 21:36:00,199 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 57 selfloop transitions, 5 changer transitions 0/1212 dead transitions. [2025-03-08 21:36:00,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1228 places, 1212 transitions, 2716 flow [2025-03-08 21:36:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:36:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:36:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7047 transitions. [2025-03-08 21:36:00,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953327922077922 [2025-03-08 21:36:00,201 INFO L175 Difference]: Start difference. First operand has 1224 places, 1209 transitions, 2582 flow. Second operand 6 states and 7047 transitions. [2025-03-08 21:36:00,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1228 places, 1212 transitions, 2716 flow [2025-03-08 21:36:00,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1222 places, 1212 transitions, 2692 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 21:36:00,211 INFO L231 Difference]: Finished difference. Result has 1222 places, 1208 transitions, 2566 flow [2025-03-08 21:36:00,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=1217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2566, PETRI_PLACES=1222, PETRI_TRANSITIONS=1208} [2025-03-08 21:36:00,212 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 3 predicate places. [2025-03-08 21:36:00,212 INFO L471 AbstractCegarLoop]: Abstraction has has 1222 places, 1208 transitions, 2566 flow [2025-03-08 21:36:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 0 states have call successors, (0), 0 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:36:00,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:00,213 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:00,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 21:36:00,213 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:36:00,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1489545194, now seen corresponding path program 1 times [2025-03-08 21:36:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301037233] [2025-03-08 21:36:00,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:00,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-08 21:36:00,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-08 21:36:00,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:00,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:00,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2354 trivial. 0 not checked. [2025-03-08 21:36:00,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:00,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301037233] [2025-03-08 21:36:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301037233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:00,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:00,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 21:36:00,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465598308] [2025-03-08 21:36:00,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:00,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 21:36:00,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:00,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 21:36:00,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 21:36:00,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-08 21:36:00,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1222 places, 1208 transitions, 2566 flow. Second operand has 4 states, 4 states have (on average 1212.5) internal successors, (4850), 4 states have internal predecessors, (4850), 0 states have call successors, (0), 0 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:36:00,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:00,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-08 21:36:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:01,548 INFO L124 PetriNetUnfolderBase]: 60/3357 cut-off events. [2025-03-08 21:36:01,549 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-08 21:36:01,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 3357 events. 60/3357 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7981 event pairs, 17 based on Foata normal form. 4/3241 useless extension candidates. Maximal degree in co-relation 2530. Up to 59 conditions per place. [2025-03-08 21:36:01,557 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 14 selfloop transitions, 4 changer transitions 0/1213 dead transitions. [2025-03-08 21:36:01,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1225 places, 1213 transitions, 2614 flow [2025-03-08 21:36:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 21:36:01,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 21:36:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4859 transitions. [2025-03-08 21:36:01,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9859983766233766 [2025-03-08 21:36:01,607 INFO L175 Difference]: Start difference. First operand has 1222 places, 1208 transitions, 2566 flow. Second operand 4 states and 4859 transitions. [2025-03-08 21:36:01,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1225 places, 1213 transitions, 2614 flow [2025-03-08 21:36:01,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1220 places, 1213 transitions, 2604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:36:01,625 INFO L231 Difference]: Finished difference. Result has 1222 places, 1211 transitions, 2584 flow [2025-03-08 21:36:01,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=1217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2584, PETRI_PLACES=1222, PETRI_TRANSITIONS=1211} [2025-03-08 21:36:01,627 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 3 predicate places. [2025-03-08 21:36:01,627 INFO L471 AbstractCegarLoop]: Abstraction has has 1222 places, 1211 transitions, 2584 flow [2025-03-08 21:36:01,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1212.5) internal successors, (4850), 4 states have internal predecessors, (4850), 0 states have call successors, (0), 0 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:36:01,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:01,628 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:01,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 21:36:01,629 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:36:01,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1899956204, now seen corresponding path program 1 times [2025-03-08 21:36:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:01,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719806425] [2025-03-08 21:36:01,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:01,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:01,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-03-08 21:36:01,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-03-08 21:36:01,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:01,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2354 trivial. 0 not checked. [2025-03-08 21:36:02,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:02,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719806425] [2025-03-08 21:36:02,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719806425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:36:02,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944425038] [2025-03-08 21:36:02,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:02,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:36:02,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:36:02,339 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:36:02,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 21:36:02,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-03-08 21:36:02,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-03-08 21:36:02,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:02,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:02,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 3738 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:36:02,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:36:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2025-03-08 21:36:02,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:36:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944425038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:36:02,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:36:02,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977859507] [2025-03-08 21:36:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:02,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:02,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:02,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:02,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:36:02,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-08 21:36:02,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1222 places, 1211 transitions, 2584 flow. Second operand has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 0 states have call successors, (0), 0 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:36:02,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:02,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-08 21:36:02,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:03,626 INFO L124 PetriNetUnfolderBase]: 53/3346 cut-off events. [2025-03-08 21:36:03,626 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-08 21:36:03,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 3346 events. 53/3346 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7854 event pairs, 12 based on Foata normal form. 0/3230 useless extension candidates. Maximal degree in co-relation 3114. Up to 44 conditions per place. [2025-03-08 21:36:03,635 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 12 selfloop transitions, 2 changer transitions 0/1211 dead transitions. [2025-03-08 21:36:03,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1223 places, 1211 transitions, 2613 flow [2025-03-08 21:36:03,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3642 transitions. [2025-03-08 21:36:03,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9853896103896104 [2025-03-08 21:36:03,638 INFO L175 Difference]: Start difference. First operand has 1222 places, 1211 transitions, 2584 flow. Second operand 3 states and 3642 transitions. [2025-03-08 21:36:03,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1223 places, 1211 transitions, 2613 flow [2025-03-08 21:36:03,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1222 places, 1211 transitions, 2611 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:36:03,651 INFO L231 Difference]: Finished difference. Result has 1222 places, 1210 transitions, 2584 flow [2025-03-08 21:36:03,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=1220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2584, PETRI_PLACES=1222, PETRI_TRANSITIONS=1210} [2025-03-08 21:36:03,652 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 3 predicate places. [2025-03-08 21:36:03,652 INFO L471 AbstractCegarLoop]: Abstraction has has 1222 places, 1210 transitions, 2584 flow [2025-03-08 21:36:03,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 0 states have call successors, (0), 0 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:36:03,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:03,654 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:03,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 21:36:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 21:36:03,854 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:36:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1741443358, now seen corresponding path program 1 times [2025-03-08 21:36:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548245177] [2025-03-08 21:36:03,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:03,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1494 statements into 1 equivalence classes. [2025-03-08 21:36:03,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1494 of 1494 statements. [2025-03-08 21:36:03,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:03,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 21:36:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:05,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548245177] [2025-03-08 21:36:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548245177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:36:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077671897] [2025-03-08 21:36:05,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:05,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:36:05,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:36:05,415 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:36:05,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 21:36:05,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1494 statements into 1 equivalence classes. [2025-03-08 21:36:05,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1494 of 1494 statements. [2025-03-08 21:36:05,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:05,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:05,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 3752 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:36:05,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:36:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 21:36:06,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:36:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-08 21:36:06,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077671897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:36:06,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:36:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-08 21:36:06,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470055735] [2025-03-08 21:36:06,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:36:06,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 21:36:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:06,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 21:36:06,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 21:36:07,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-08 21:36:07,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1222 places, 1210 transitions, 2584 flow. Second operand has 34 states, 34 states have (on average 1212.0588235294117) internal successors, (41210), 34 states have internal predecessors, (41210), 0 states have call successors, (0), 0 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:36:07,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:07,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-08 21:36:07,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:08,611 INFO L124 PetriNetUnfolderBase]: 122/4905 cut-off events. [2025-03-08 21:36:08,611 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-03-08 21:36:08,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 4905 events. 122/4905 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11104 event pairs, 10 based on Foata normal form. 16/4788 useless extension candidates. Maximal degree in co-relation 5595. Up to 67 conditions per place. [2025-03-08 21:36:08,621 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 68 selfloop transitions, 45 changer transitions 0/1290 dead transitions. [2025-03-08 21:36:08,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1266 places, 1290 transitions, 3254 flow [2025-03-08 21:36:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 21:36:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-08 21:36:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54571 transitions. [2025-03-08 21:36:08,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9843253968253968 [2025-03-08 21:36:08,690 INFO L175 Difference]: Start difference. First operand has 1222 places, 1210 transitions, 2584 flow. Second operand 45 states and 54571 transitions. [2025-03-08 21:36:08,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1266 places, 1290 transitions, 3254 flow [2025-03-08 21:36:08,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1264 places, 1290 transitions, 3250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:08,700 INFO L231 Difference]: Finished difference. Result has 1273 places, 1235 transitions, 2882 flow [2025-03-08 21:36:08,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=1220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2882, PETRI_PLACES=1273, PETRI_TRANSITIONS=1235} [2025-03-08 21:36:08,701 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 54 predicate places. [2025-03-08 21:36:08,702 INFO L471 AbstractCegarLoop]: Abstraction has has 1273 places, 1235 transitions, 2882 flow [2025-03-08 21:36:08,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1212.0588235294117) internal successors, (41210), 34 states have internal predecessors, (41210), 0 states have call successors, (0), 0 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:36:08,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:08,707 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 21:36:08,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:36:08,907 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:36:08,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash 502561506, now seen corresponding path program 2 times [2025-03-08 21:36:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168940946] [2025-03-08 21:36:08,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:36:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:09,017 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2094 statements into 2 equivalence classes. [2025-03-08 21:36:09,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 925 of 2094 statements. [2025-03-08 21:36:09,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:36:09,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 11304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11304 trivial. 0 not checked. [2025-03-08 21:36:10,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:10,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168940946] [2025-03-08 21:36:10,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168940946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:10,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:10,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:36:10,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681493481] [2025-03-08 21:36:10,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:10,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:36:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:10,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:36:10,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:36:10,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1154 out of 1232 [2025-03-08 21:36:10,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1273 places, 1235 transitions, 2882 flow. Second operand has 6 states, 6 states have (on average 1160.6666666666667) internal successors, (6964), 6 states have internal predecessors, (6964), 0 states have call successors, (0), 0 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:36:10,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:10,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1154 of 1232 [2025-03-08 21:36:10,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:12,493 INFO L124 PetriNetUnfolderBase]: 466/5223 cut-off events. [2025-03-08 21:36:12,493 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-08 21:36:12,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7645 conditions, 5223 events. 466/5223 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15403 event pairs, 353 based on Foata normal form. 0/5131 useless extension candidates. Maximal degree in co-relation 6210. Up to 1085 conditions per place. [2025-03-08 21:36:12,505 INFO L140 encePairwiseOnDemand]: 1223/1232 looper letters, 64 selfloop transitions, 6 changer transitions 0/1236 dead transitions. [2025-03-08 21:36:12,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1275 places, 1236 transitions, 3028 flow [2025-03-08 21:36:12,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:36:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:36:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6997 transitions. [2025-03-08 21:36:12,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465638528138528 [2025-03-08 21:36:12,508 INFO L175 Difference]: Start difference. First operand has 1273 places, 1235 transitions, 2882 flow. Second operand 6 states and 6997 transitions. [2025-03-08 21:36:12,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1275 places, 1236 transitions, 3028 flow [2025-03-08 21:36:12,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1257 places, 1236 transitions, 2972 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-03-08 21:36:12,519 INFO L231 Difference]: Finished difference. Result has 1257 places, 1232 transitions, 2832 flow [2025-03-08 21:36:12,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2820, PETRI_DIFFERENCE_MINUEND_PLACES=1252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2832, PETRI_PLACES=1257, PETRI_TRANSITIONS=1232} [2025-03-08 21:36:12,520 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 38 predicate places. [2025-03-08 21:36:12,520 INFO L471 AbstractCegarLoop]: Abstraction has has 1257 places, 1232 transitions, 2832 flow [2025-03-08 21:36:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1160.6666666666667) internal successors, (6964), 6 states have internal predecessors, (6964), 0 states have call successors, (0), 0 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:36:12,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:12,521 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 21:36:12,521 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:36:12,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2008444362, now seen corresponding path program 1 times [2025-03-08 21:36:12,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:12,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165981938] [2025-03-08 21:36:12,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:12,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:12,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2098 statements into 1 equivalence classes. [2025-03-08 21:36:12,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2098 of 2098 statements. [2025-03-08 21:36:12,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:12,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 11305 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11304 trivial. 0 not checked. [2025-03-08 21:36:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165981938] [2025-03-08 21:36:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165981938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:36:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124327332] [2025-03-08 21:36:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:13,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:36:13,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:36:13,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:36:13,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 21:36:14,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2098 statements into 1 equivalence classes. [2025-03-08 21:36:14,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2098 of 2098 statements. [2025-03-08 21:36:14,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:14,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:14,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 21:36:14,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:36:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11305 trivial. 0 not checked. [2025-03-08 21:36:14,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 21:36:14,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124327332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:14,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 21:36:14,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 21:36:14,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385804071] [2025-03-08 21:36:14,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:14,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:14,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:14,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:14,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:36:14,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-08 21:36:14,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1257 places, 1232 transitions, 2832 flow. Second operand has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 0 states have call successors, (0), 0 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:36:14,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:14,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-08 21:36:14,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:16,098 INFO L124 PetriNetUnfolderBase]: 67/4820 cut-off events. [2025-03-08 21:36:16,098 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-03-08 21:36:16,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5425 conditions, 4820 events. 67/4820 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10161 event pairs, 10 based on Foata normal form. 0/4716 useless extension candidates. Maximal degree in co-relation 4585. Up to 60 conditions per place. [2025-03-08 21:36:16,114 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 9 selfloop transitions, 0 changer transitions 5/1232 dead transitions. [2025-03-08 21:36:16,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1258 places, 1232 transitions, 2861 flow [2025-03-08 21:36:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3642 transitions. [2025-03-08 21:36:16,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9853896103896104 [2025-03-08 21:36:16,117 INFO L175 Difference]: Start difference. First operand has 1257 places, 1232 transitions, 2832 flow. Second operand 3 states and 3642 transitions. [2025-03-08 21:36:16,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1258 places, 1232 transitions, 2861 flow [2025-03-08 21:36:16,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1253 places, 1232 transitions, 2849 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:36:16,131 INFO L231 Difference]: Finished difference. Result has 1253 places, 1227 transitions, 2810 flow [2025-03-08 21:36:16,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2818, PETRI_DIFFERENCE_MINUEND_PLACES=1251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2810, PETRI_PLACES=1253, PETRI_TRANSITIONS=1227} [2025-03-08 21:36:16,132 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 34 predicate places. [2025-03-08 21:36:16,132 INFO L471 AbstractCegarLoop]: Abstraction has has 1253 places, 1227 transitions, 2810 flow [2025-03-08 21:36:16,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 0 states have call successors, (0), 0 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:36:16,132 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:16,133 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:16,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 21:36:16,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-08 21:36:16,334 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-08 21:36:16,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1707928571, now seen corresponding path program 1 times [2025-03-08 21:36:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:16,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386720645] [2025-03-08 21:36:16,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:16,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2100 statements into 1 equivalence classes. [2025-03-08 21:36:16,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2100 of 2100 statements. [2025-03-08 21:36:16,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:16,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat