./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.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 bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:05:36,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:05:36,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:05:36,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:05:36,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:05:36,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:05:36,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:05:36,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:05:36,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:05:36,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:05:36,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:05:36,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:05:36,501 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:05:36,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:05:36,502 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:05:36,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:05:36,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:05:36,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:05:36,503 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 -> bbb47797d2c6a4d5e961c4dfd7a8e6f4ff79c632e04c289068b1b9e8cca736fa [2025-03-17 11:05:36,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:05:36,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:05:36,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:05:36,740 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:05:36,740 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:05:36,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-03-17 11:05:37,882 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783350365/23cc5b07f1db4b269b646bf6ebe148f2/FLAG473941368 [2025-03-17 11:05:38,185 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:05:38,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-03-17 11:05:38,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783350365/23cc5b07f1db4b269b646bf6ebe148f2/FLAG473941368 [2025-03-17 11:05:38,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/783350365/23cc5b07f1db4b269b646bf6ebe148f2 [2025-03-17 11:05:38,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:05:38,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:05:38,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:05:38,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:05:38,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:05:38,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce7c185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38, skipping insertion in model container [2025-03-17 11:05:38,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:05:38,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:05:38,563 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:05:38,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:05:38,664 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:05:38,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38 WrapperNode [2025-03-17 11:05:38,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:05:38,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:05:38,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:05:38,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:05:38,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,703 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 242 [2025-03-17 11:05:38,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:05:38,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:05:38,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:05:38,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:05:38,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:05:38,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:05:38,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:05:38,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:05:38,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (1/1) ... [2025-03-17 11:05:38,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:05:38,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:38,756 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-17 11:05:38,760 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-17 11:05:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:05:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-17 11:05:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:05:38,773 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:05:38,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:05:38,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:05:38,774 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:05:38,879 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:05:38,880 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:05:39,291 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:05:39,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:05:39,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:05:39,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:05:39,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:05:39 BoogieIcfgContainer [2025-03-17 11:05:39,318 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:05:39,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:05:39,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:05:39,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:05:39,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:05:38" (1/3) ... [2025-03-17 11:05:39,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417c4728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:05:39, skipping insertion in model container [2025-03-17 11:05:39,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:38" (2/3) ... [2025-03-17 11:05:39,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417c4728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:05:39, skipping insertion in model container [2025-03-17 11:05:39,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:05:39" (3/3) ... [2025-03-17 11:05:39,327 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2025-03-17 11:05:39,338 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:05:39,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_09-arraylist.i that has 2 procedures, 284 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-03-17 11:05:39,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:05:39,418 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:05:39,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 286 transitions, 576 flow [2025-03-17 11:05:39,516 INFO L124 PetriNetUnfolderBase]: 3/285 cut-off events. [2025-03-17 11:05:39,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:39,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 285 events. 3/285 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 407 event pairs, 0 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 157. Up to 2 conditions per place. [2025-03-17 11:05:39,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 287 places, 286 transitions, 576 flow [2025-03-17 11:05:39,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 285 transitions, 573 flow [2025-03-17 11:05:39,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:05:39,550 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;@4a89496, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:05:39,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-17 11:05:39,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:05:39,563 INFO L124 PetriNetUnfolderBase]: 1/75 cut-off events. [2025-03-17 11:05:39,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:39,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:39,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:39,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:39,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash 845303735, now seen corresponding path program 1 times [2025-03-17 11:05:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:39,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733008460] [2025-03-17 11:05:39,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:39,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:39,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:05:39,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:05:39,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:39,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:40,225 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-17 11:05:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733008460] [2025-03-17 11:05:40,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733008460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:40,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:40,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662083415] [2025-03-17 11:05:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:40,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:40,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:40,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:40,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-03-17 11:05:40,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 285 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 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-17 11:05:40,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:40,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-03-17 11:05:40,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:40,922 INFO L124 PetriNetUnfolderBase]: 365/1634 cut-off events. [2025-03-17 11:05:40,922 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:40,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2448 conditions, 1634 events. 365/1634 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10087 event pairs, 364 based on Foata normal form. 11/1518 useless extension candidates. Maximal degree in co-relation 2247. Up to 800 conditions per place. [2025-03-17 11:05:40,931 INFO L140 encePairwiseOnDemand]: 272/286 looper letters, 71 selfloop transitions, 10 changer transitions 1/281 dead transitions. [2025-03-17 11:05:40,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 727 flow [2025-03-17 11:05:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-03-17 11:05:40,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7523310023310024 [2025-03-17 11:05:40,950 INFO L175 Difference]: Start difference. First operand has 286 places, 285 transitions, 573 flow. Second operand 6 states and 1291 transitions. [2025-03-17 11:05:40,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 727 flow [2025-03-17 11:05:40,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 281 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:40,962 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 582 flow [2025-03-17 11:05:40,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=288, PETRI_TRANSITIONS=280} [2025-03-17 11:05:40,968 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-03-17 11:05:40,968 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 582 flow [2025-03-17 11:05:40,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 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-17 11:05:40,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:40,969 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] [2025-03-17 11:05:40,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:05:40,970 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:40,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash 872533347, now seen corresponding path program 1 times [2025-03-17 11:05:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:40,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573575184] [2025-03-17 11:05:40,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:40,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:40,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 11:05:40,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 11:05:40,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:40,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:41,048 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-17 11:05:41,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:41,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573575184] [2025-03-17 11:05:41,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573575184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:41,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:41,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:05:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279217431] [2025-03-17 11:05:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:41,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:41,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:41,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:41,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:41,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 286 [2025-03-17 11:05:41,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 280 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-17 11:05:41,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:41,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 286 [2025-03-17 11:05:41,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:41,170 INFO L124 PetriNetUnfolderBase]: 7/467 cut-off events. [2025-03-17 11:05:41,170 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:41,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 467 events. 7/467 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 879 event pairs, 6 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 299. Up to 24 conditions per place. [2025-03-17 11:05:41,172 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 10 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-17 11:05:41,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 608 flow [2025-03-17 11:05:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2025-03-17 11:05:41,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-17 11:05:41,176 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 582 flow. Second operand 3 states and 832 transitions. [2025-03-17 11:05:41,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 608 flow [2025-03-17 11:05:41,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:41,188 INFO L231 Difference]: Finished difference. Result has 285 places, 281 transitions, 574 flow [2025-03-17 11:05:41,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=285, PETRI_TRANSITIONS=281} [2025-03-17 11:05:41,189 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-03-17 11:05:41,189 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 281 transitions, 574 flow [2025-03-17 11:05:41,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 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-17 11:05:41,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:41,190 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] [2025-03-17 11:05:41,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:05:41,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:41,191 INFO L85 PathProgramCache]: Analyzing trace with hash -80540808, now seen corresponding path program 1 times [2025-03-17 11:05:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823356813] [2025-03-17 11:05:41,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:41,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:41,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 11:05:41,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 11:05:41,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:41,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:41,518 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-17 11:05:41,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:41,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823356813] [2025-03-17 11:05:41,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823356813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:41,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:41,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:41,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765129286] [2025-03-17 11:05:41,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:41,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:41,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:41,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:41,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-03-17 11:05:41,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 281 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 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-17 11:05:41,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:41,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-03-17 11:05:41,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:42,129 INFO L124 PetriNetUnfolderBase]: 365/1740 cut-off events. [2025-03-17 11:05:42,129 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:42,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2600 conditions, 1740 events. 365/1740 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9995 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2408. Up to 830 conditions per place. [2025-03-17 11:05:42,138 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 71 selfloop transitions, 10 changer transitions 0/279 dead transitions. [2025-03-17 11:05:42,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 732 flow [2025-03-17 11:05:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1289 transitions. [2025-03-17 11:05:42,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511655011655012 [2025-03-17 11:05:42,141 INFO L175 Difference]: Start difference. First operand has 285 places, 281 transitions, 574 flow. Second operand 6 states and 1289 transitions. [2025-03-17 11:05:42,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 732 flow [2025-03-17 11:05:42,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 279 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:42,148 INFO L231 Difference]: Finished difference. Result has 287 places, 279 transitions, 588 flow [2025-03-17 11:05:42,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=287, PETRI_TRANSITIONS=279} [2025-03-17 11:05:42,150 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 1 predicate places. [2025-03-17 11:05:42,150 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 279 transitions, 588 flow [2025-03-17 11:05:42,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.33333333333334) internal successors, (1214), 6 states have internal predecessors, (1214), 0 states have call successors, (0), 0 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-17 11:05:42,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:42,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:42,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:05:42,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:42,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:42,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1343259310, now seen corresponding path program 1 times [2025-03-17 11:05:42,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:42,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032424546] [2025-03-17 11:05:42,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:42,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:42,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 11:05:42,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 11:05:42,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:42,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:42,444 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-17 11:05:42,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:42,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032424546] [2025-03-17 11:05:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032424546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:42,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929153548] [2025-03-17 11:05:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:42,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:42,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:42,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 286 [2025-03-17 11:05:42,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 279 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 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-17 11:05:42,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:42,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 286 [2025-03-17 11:05:42,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:43,018 INFO L124 PetriNetUnfolderBase]: 391/1828 cut-off events. [2025-03-17 11:05:43,018 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 11:05:43,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1828 events. 391/1828 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10760 event pairs, 390 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2491. Up to 899 conditions per place. [2025-03-17 11:05:43,025 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 83 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2025-03-17 11:05:43,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 278 transitions, 762 flow [2025-03-17 11:05:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1264 transitions. [2025-03-17 11:05:43,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7365967365967366 [2025-03-17 11:05:43,028 INFO L175 Difference]: Start difference. First operand has 287 places, 279 transitions, 588 flow. Second operand 6 states and 1264 transitions. [2025-03-17 11:05:43,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 278 transitions, 762 flow [2025-03-17 11:05:43,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 278 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:43,032 INFO L231 Difference]: Finished difference. Result has 286 places, 278 transitions, 576 flow [2025-03-17 11:05:43,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=286, PETRI_TRANSITIONS=278} [2025-03-17 11:05:43,033 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2025-03-17 11:05:43,033 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 278 transitions, 576 flow [2025-03-17 11:05:43,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 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-17 11:05:43,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:43,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] [2025-03-17 11:05:43,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:05:43,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:43,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 726308063, now seen corresponding path program 1 times [2025-03-17 11:05:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:43,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787062485] [2025-03-17 11:05:43,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:43,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 11:05:43,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 11:05:43,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:43,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:43,479 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-17 11:05:43,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787062485] [2025-03-17 11:05:43,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787062485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:43,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:43,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796548345] [2025-03-17 11:05:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:43,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:43,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:43,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:43,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 286 [2025-03-17 11:05:43,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 278 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 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-17 11:05:43,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:43,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 286 [2025-03-17 11:05:43,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:44,100 INFO L124 PetriNetUnfolderBase]: 55/702 cut-off events. [2025-03-17 11:05:44,100 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:05:44,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 702 events. 55/702 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2657 event pairs, 54 based on Foata normal form. 0/650 useless extension candidates. Maximal degree in co-relation 717. Up to 195 conditions per place. [2025-03-17 11:05:44,102 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 57 selfloop transitions, 5 changer transitions 0/277 dead transitions. [2025-03-17 11:05:44,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 277 transitions, 698 flow [2025-03-17 11:05:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2025-03-17 11:05:44,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8123543123543123 [2025-03-17 11:05:44,105 INFO L175 Difference]: Start difference. First operand has 286 places, 278 transitions, 576 flow. Second operand 6 states and 1394 transitions. [2025-03-17 11:05:44,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 277 transitions, 698 flow [2025-03-17 11:05:44,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 277 transitions, 688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:44,109 INFO L231 Difference]: Finished difference. Result has 285 places, 277 transitions, 574 flow [2025-03-17 11:05:44,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=574, PETRI_PLACES=285, PETRI_TRANSITIONS=277} [2025-03-17 11:05:44,111 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-03-17 11:05:44,111 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 277 transitions, 574 flow [2025-03-17 11:05:44,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 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-17 11:05:44,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:44,112 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] [2025-03-17 11:05:44,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:05:44,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:44,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1463927439, now seen corresponding path program 1 times [2025-03-17 11:05:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777722461] [2025-03-17 11:05:44,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:44,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 11:05:44,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 11:05:44,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:44,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:44,498 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-17 11:05:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:44,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777722461] [2025-03-17 11:05:44,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777722461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:44,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:44,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:44,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459784830] [2025-03-17 11:05:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:44,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:44,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:44,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:44,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:44,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-17 11:05:44,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 277 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 0 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-17 11:05:44,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:44,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-17 11:05:44,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:44,994 INFO L124 PetriNetUnfolderBase]: 37/617 cut-off events. [2025-03-17 11:05:44,994 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:05:44,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 617 events. 37/617 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2092 event pairs, 36 based on Foata normal form. 0/578 useless extension candidates. Maximal degree in co-relation 581. Up to 158 conditions per place. [2025-03-17 11:05:44,996 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 53 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2025-03-17 11:05:44,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 688 flow [2025-03-17 11:05:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-03-17 11:05:44,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-03-17 11:05:44,999 INFO L175 Difference]: Start difference. First operand has 285 places, 277 transitions, 574 flow. Second operand 6 states and 1409 transitions. [2025-03-17 11:05:44,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 688 flow [2025-03-17 11:05:45,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 276 transitions, 678 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:45,002 INFO L231 Difference]: Finished difference. Result has 284 places, 276 transitions, 572 flow [2025-03-17 11:05:45,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=572, PETRI_PLACES=284, PETRI_TRANSITIONS=276} [2025-03-17 11:05:45,003 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -2 predicate places. [2025-03-17 11:05:45,003 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 276 transitions, 572 flow [2025-03-17 11:05:45,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.5) internal successors, (1377), 6 states have internal predecessors, (1377), 0 states have call successors, (0), 0 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-17 11:05:45,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:45,004 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] [2025-03-17 11:05:45,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:05:45,004 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:45,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1337111357, now seen corresponding path program 1 times [2025-03-17 11:05:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349716485] [2025-03-17 11:05:45,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:45,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:45,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-17 11:05:45,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-17 11:05:45,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:45,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:45,349 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-17 11:05:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349716485] [2025-03-17 11:05:45,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349716485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:45,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:45,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340615030] [2025-03-17 11:05:45,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:45,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:45,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:45,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:45,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:45,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-03-17 11:05:45,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 276 transitions, 572 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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-17 11:05:45,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:45,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-03-17 11:05:45,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:45,777 INFO L124 PetriNetUnfolderBase]: 365/1732 cut-off events. [2025-03-17 11:05:45,777 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:05:45,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1732 events. 365/1732 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9899 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2390. Up to 846 conditions per place. [2025-03-17 11:05:45,787 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 79 selfloop transitions, 5 changer transitions 0/275 dead transitions. [2025-03-17 11:05:45,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 275 transitions, 738 flow [2025-03-17 11:05:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:45,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-03-17 11:05:45,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-03-17 11:05:45,791 INFO L175 Difference]: Start difference. First operand has 284 places, 276 transitions, 572 flow. Second operand 6 states and 1279 transitions. [2025-03-17 11:05:45,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 275 transitions, 738 flow [2025-03-17 11:05:45,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 275 transitions, 728 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:45,795 INFO L231 Difference]: Finished difference. Result has 283 places, 275 transitions, 570 flow [2025-03-17 11:05:45,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=283, PETRI_TRANSITIONS=275} [2025-03-17 11:05:45,796 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -3 predicate places. [2025-03-17 11:05:45,797 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 275 transitions, 570 flow [2025-03-17 11:05:45,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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-17 11:05:45,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:45,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:45,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:05:45,798 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:45,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash 247924765, now seen corresponding path program 1 times [2025-03-17 11:05:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:45,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409113023] [2025-03-17 11:05:45,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:45,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 11:05:45,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 11:05:45,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:45,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:46,150 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-17 11:05:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:46,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409113023] [2025-03-17 11:05:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409113023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:46,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469984830] [2025-03-17 11:05:46,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:46,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:46,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:46,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:46,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-03-17 11:05:46,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 275 transitions, 570 flow. Second operand has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-17 11:05:46,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:46,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-03-17 11:05:46,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:46,618 INFO L124 PetriNetUnfolderBase]: 365/1730 cut-off events. [2025-03-17 11:05:46,618 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:05:46,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 1730 events. 365/1730 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9937 event pairs, 364 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 2395. Up to 844 conditions per place. [2025-03-17 11:05:46,629 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 78 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2025-03-17 11:05:46,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 274 transitions, 734 flow [2025-03-17 11:05:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-03-17 11:05:46,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-03-17 11:05:46,633 INFO L175 Difference]: Start difference. First operand has 283 places, 275 transitions, 570 flow. Second operand 6 states and 1284 transitions. [2025-03-17 11:05:46,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 274 transitions, 734 flow [2025-03-17 11:05:46,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 274 transitions, 724 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:46,638 INFO L231 Difference]: Finished difference. Result has 282 places, 274 transitions, 568 flow [2025-03-17 11:05:46,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=282, PETRI_TRANSITIONS=274} [2025-03-17 11:05:46,639 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -4 predicate places. [2025-03-17 11:05:46,640 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 274 transitions, 568 flow [2025-03-17 11:05:46,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-17 11:05:46,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:46,641 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] [2025-03-17 11:05:46,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:05:46,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1814477751, now seen corresponding path program 1 times [2025-03-17 11:05:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:46,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205042821] [2025-03-17 11:05:46,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:46,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:05:46,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:05:46,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:46,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:46,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205042821] [2025-03-17 11:05:46,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205042821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:46,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10317999] [2025-03-17 11:05:46,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:46,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:46,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:46,795 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-17 11:05:46,796 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-17 11:05:46,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-17 11:05:46,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-17 11:05:46,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:46,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:46,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 11:05:46,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:47,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:47,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10317999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:47,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:47,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 11:05:47,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892850034] [2025-03-17 11:05:47,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:47,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:05:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:47,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:05:47,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-17 11:05:47,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-03-17 11:05:47,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 274 transitions, 568 flow. Second operand has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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-17 11:05:47,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:47,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-03-17 11:05:47,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:47,467 INFO L124 PetriNetUnfolderBase]: 7/560 cut-off events. [2025-03-17 11:05:47,467 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:47,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 560 events. 7/560 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 396 event pairs, 6 based on Foata normal form. 2/542 useless extension candidates. Maximal degree in co-relation 244. Up to 24 conditions per place. [2025-03-17 11:05:47,468 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 14 selfloop transitions, 9 changer transitions 0/282 dead transitions. [2025-03-17 11:05:47,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 282 transitions, 632 flow [2025-03-17 11:05:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 11:05:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 11:05:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2455 transitions. [2025-03-17 11:05:47,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9537684537684538 [2025-03-17 11:05:47,473 INFO L175 Difference]: Start difference. First operand has 282 places, 274 transitions, 568 flow. Second operand 9 states and 2455 transitions. [2025-03-17 11:05:47,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 282 transitions, 632 flow [2025-03-17 11:05:47,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 282 transitions, 622 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:47,476 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 608 flow [2025-03-17 11:05:47,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=608, PETRI_PLACES=288, PETRI_TRANSITIONS=280} [2025-03-17 11:05:47,477 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-03-17 11:05:47,477 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 608 flow [2025-03-17 11:05:47,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 272.0) internal successors, (2720), 10 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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-17 11:05:47,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:47,479 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, 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] [2025-03-17 11:05:47,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 11:05:47,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:47,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:47,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1811959415, now seen corresponding path program 2 times [2025-03-17 11:05:47,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:47,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205842335] [2025-03-17 11:05:47,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:47,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-03-17 11:05:47,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 52 of 367 statements. [2025-03-17 11:05:47,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:05:47,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-17 11:05:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:47,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205842335] [2025-03-17 11:05:47,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205842335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:47,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:47,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:47,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824461923] [2025-03-17 11:05:47,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:47,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:47,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:47,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:48,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-17 11:05:48,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 280 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 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-17 11:05:48,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:48,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-17 11:05:48,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:48,738 INFO L124 PetriNetUnfolderBase]: 257/1877 cut-off events. [2025-03-17 11:05:48,738 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:05:48,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 1877 events. 257/1877 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10091 event pairs, 36 based on Foata normal form. 0/1751 useless extension candidates. Maximal degree in co-relation 2076. Up to 491 conditions per place. [2025-03-17 11:05:48,744 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 67 selfloop transitions, 70 changer transitions 0/358 dead transitions. [2025-03-17 11:05:48,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 358 transitions, 1038 flow [2025-03-17 11:05:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-03-17 11:05:48,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-03-17 11:05:48,747 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 608 flow. Second operand 6 states and 1488 transitions. [2025-03-17 11:05:48,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 358 transitions, 1038 flow [2025-03-17 11:05:48,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 358 transitions, 1032 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:48,754 INFO L231 Difference]: Finished difference. Result has 297 places, 349 transitions, 1064 flow [2025-03-17 11:05:48,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1064, PETRI_PLACES=297, PETRI_TRANSITIONS=349} [2025-03-17 11:05:48,755 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 11 predicate places. [2025-03-17 11:05:48,755 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 349 transitions, 1064 flow [2025-03-17 11:05:48,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 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-17 11:05:48,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:48,757 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, 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] [2025-03-17 11:05:48,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:05:48,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:48,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1841511027, now seen corresponding path program 1 times [2025-03-17 11:05:48,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:48,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121668490] [2025-03-17 11:05:48,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:48,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-17 11:05:48,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-17 11:05:48,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:48,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:05:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121668490] [2025-03-17 11:05:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121668490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872534599] [2025-03-17 11:05:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:49,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:49,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:49,139 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-17 11:05:49,140 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-17 11:05:49,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-17 11:05:49,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-17 11:05:49,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:49,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:49,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 11:05:49,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:05:49,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 11:05:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872534599] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:50,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:50,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-17 11:05:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715325084] [2025-03-17 11:05:50,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:50,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:05:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:50,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:05:50,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-17 11:05:50,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-03-17 11:05:50,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 349 transitions, 1064 flow. Second operand has 18 states, 18 states have (on average 272.0) internal successors, (4896), 18 states have internal predecessors, (4896), 0 states have call successors, (0), 0 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-17 11:05:50,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:50,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-03-17 11:05:50,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:50,757 INFO L124 PetriNetUnfolderBase]: 150/1983 cut-off events. [2025-03-17 11:05:50,757 INFO L125 PetriNetUnfolderBase]: For 184/204 co-relation queries the response was YES. [2025-03-17 11:05:50,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2678 conditions, 1983 events. 150/1983 cut-off events. For 184/204 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7302 event pairs, 21 based on Foata normal form. 4/1900 useless extension candidates. Maximal degree in co-relation 1821. Up to 206 conditions per place. [2025-03-17 11:05:50,764 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 19 selfloop transitions, 21 changer transitions 0/367 dead transitions. [2025-03-17 11:05:50,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 367 transitions, 1232 flow [2025-03-17 11:05:50,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:05:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:05:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5713 transitions. [2025-03-17 11:05:50,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512154512154513 [2025-03-17 11:05:50,775 INFO L175 Difference]: Start difference. First operand has 297 places, 349 transitions, 1064 flow. Second operand 21 states and 5713 transitions. [2025-03-17 11:05:50,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 367 transitions, 1232 flow [2025-03-17 11:05:50,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 367 transitions, 1232 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:50,783 INFO L231 Difference]: Finished difference. Result has 322 places, 362 transitions, 1194 flow [2025-03-17 11:05:50,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1194, PETRI_PLACES=322, PETRI_TRANSITIONS=362} [2025-03-17 11:05:50,784 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-03-17 11:05:50,784 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 362 transitions, 1194 flow [2025-03-17 11:05:50,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 272.0) internal successors, (4896), 18 states have internal predecessors, (4896), 0 states have call successors, (0), 0 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-17 11:05:50,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:50,786 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, 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] [2025-03-17 11:05:50,795 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-17 11:05:50,987 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,SelfDestructingSolverStorable10 [2025-03-17 11:05:50,987 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -720416755, now seen corresponding path program 2 times [2025-03-17 11:05:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:50,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366886505] [2025-03-17 11:05:50,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:50,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:51,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 793 statements into 2 equivalence classes. [2025-03-17 11:05:51,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 793 statements. [2025-03-17 11:05:51,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:05:51,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2506 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2025-03-17 11:05:51,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:51,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366886505] [2025-03-17 11:05:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366886505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:51,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:51,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492628192] [2025-03-17 11:05:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:51,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:51,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:51,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:51,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-17 11:05:51,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 362 transitions, 1194 flow. Second operand has 6 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 0 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-17 11:05:51,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:51,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-17 11:05:51,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:52,316 INFO L124 PetriNetUnfolderBase]: 530/3052 cut-off events. [2025-03-17 11:05:52,316 INFO L125 PetriNetUnfolderBase]: For 866/949 co-relation queries the response was YES. [2025-03-17 11:05:52,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5346 conditions, 3052 events. 530/3052 cut-off events. For 866/949 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16098 event pairs, 92 based on Foata normal form. 16/2911 useless extension candidates. Maximal degree in co-relation 4285. Up to 981 conditions per place. [2025-03-17 11:05:52,330 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 131 selfloop transitions, 130 changer transitions 0/499 dead transitions. [2025-03-17 11:05:52,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 499 transitions, 2366 flow [2025-03-17 11:05:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:52,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:52,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2025-03-17 11:05:52,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665501165501166 [2025-03-17 11:05:52,333 INFO L175 Difference]: Start difference. First operand has 322 places, 362 transitions, 1194 flow. Second operand 6 states and 1487 transitions. [2025-03-17 11:05:52,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 499 transitions, 2366 flow [2025-03-17 11:05:52,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 499 transitions, 2342 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-17 11:05:52,341 INFO L231 Difference]: Finished difference. Result has 326 places, 491 transitions, 2398 flow [2025-03-17 11:05:52,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2398, PETRI_PLACES=326, PETRI_TRANSITIONS=491} [2025-03-17 11:05:52,342 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 40 predicate places. [2025-03-17 11:05:52,342 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 491 transitions, 2398 flow [2025-03-17 11:05:52,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 0 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-17 11:05:52,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:52,343 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, 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] [2025-03-17 11:05:52,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:05:52,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:52,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:52,345 INFO L85 PathProgramCache]: Analyzing trace with hash 742436310, now seen corresponding path program 1 times [2025-03-17 11:05:52,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:52,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664734050] [2025-03-17 11:05:52,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:52,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:52,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-03-17 11:05:52,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-03-17 11:05:52,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:52,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2506 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-17 11:05:53,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664734050] [2025-03-17 11:05:53,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664734050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:53,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060888942] [2025-03-17 11:05:53,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:53,728 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-17 11:05:53,729 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-17 11:05:54,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-03-17 11:05:54,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-03-17 11:05:54,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:54,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:54,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 3147 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 11:05:54,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2506 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-17 11:05:54,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2506 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-17 11:05:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060888942] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:55,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:55,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-17 11:05:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269635837] [2025-03-17 11:05:55,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:55,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 11:05:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:55,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 11:05:55,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-17 11:05:55,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-03-17 11:05:55,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 491 transitions, 2398 flow. Second operand has 23 states, 23 states have (on average 272.0869565217391) internal successors, (6258), 23 states have internal predecessors, (6258), 0 states have call successors, (0), 0 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-17 11:05:55,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:55,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-03-17 11:05:55,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:56,589 INFO L124 PetriNetUnfolderBase]: 398/3065 cut-off events. [2025-03-17 11:05:56,589 INFO L125 PetriNetUnfolderBase]: For 1177/1221 co-relation queries the response was YES. [2025-03-17 11:05:56,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 3065 events. 398/3065 cut-off events. For 1177/1221 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13345 event pairs, 39 based on Foata normal form. 7/2964 useless extension candidates. Maximal degree in co-relation 4006. Up to 468 conditions per place. [2025-03-17 11:05:56,609 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 22 selfloop transitions, 30 changer transitions 0/508 dead transitions. [2025-03-17 11:05:56,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 508 transitions, 2624 flow [2025-03-17 11:05:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 11:05:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 11:05:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8154 transitions. [2025-03-17 11:05:56,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503496503496504 [2025-03-17 11:05:56,620 INFO L175 Difference]: Start difference. First operand has 326 places, 491 transitions, 2398 flow. Second operand 30 states and 8154 transitions. [2025-03-17 11:05:56,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 508 transitions, 2624 flow [2025-03-17 11:05:56,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 508 transitions, 2624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:56,631 INFO L231 Difference]: Finished difference. Result has 359 places, 501 transitions, 2550 flow [2025-03-17 11:05:56,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2398, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2550, PETRI_PLACES=359, PETRI_TRANSITIONS=501} [2025-03-17 11:05:56,632 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 73 predicate places. [2025-03-17 11:05:56,632 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 501 transitions, 2550 flow [2025-03-17 11:05:56,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 272.0869565217391) internal successors, (6258), 23 states have internal predecessors, (6258), 0 states have call successors, (0), 0 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-17 11:05:56,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:56,634 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:56,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:05:56,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:56,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:56,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash -742235920, now seen corresponding path program 2 times [2025-03-17 11:05:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:56,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268946558] [2025-03-17 11:05:56,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:56,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1118 statements into 2 equivalence classes. [2025-03-17 11:05:56,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 1118 statements. [2025-03-17 11:05:56,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:05:56,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2025-03-17 11:05:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:57,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268946558] [2025-03-17 11:05:57,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268946558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:57,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:57,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:57,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057244865] [2025-03-17 11:05:57,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:57,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:57,401 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-17 11:05:57,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 501 transitions, 2550 flow. Second operand has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 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-17 11:05:57,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:57,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-17 11:05:57,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:58,517 INFO L124 PetriNetUnfolderBase]: 806/4162 cut-off events. [2025-03-17 11:05:58,517 INFO L125 PetriNetUnfolderBase]: For 3302/3537 co-relation queries the response was YES. [2025-03-17 11:05:58,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 4162 events. 806/4162 cut-off events. For 3302/3537 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22328 event pairs, 74 based on Foata normal form. 76/4063 useless extension candidates. Maximal degree in co-relation 7209. Up to 1323 conditions per place. [2025-03-17 11:05:58,531 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 251 selfloop transitions, 131 changer transitions 5/639 dead transitions. [2025-03-17 11:05:58,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 639 transitions, 4224 flow [2025-03-17 11:05:58,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-03-17 11:05:58,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-03-17 11:05:58,533 INFO L175 Difference]: Start difference. First operand has 359 places, 501 transitions, 2550 flow. Second operand 6 states and 1488 transitions. [2025-03-17 11:05:58,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 639 transitions, 4224 flow [2025-03-17 11:05:58,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 639 transitions, 4178 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-17 11:05:58,545 INFO L231 Difference]: Finished difference. Result has 351 places, 629 transitions, 3984 flow [2025-03-17 11:05:58,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=2504, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3984, PETRI_PLACES=351, PETRI_TRANSITIONS=629} [2025-03-17 11:05:58,545 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 65 predicate places. [2025-03-17 11:05:58,545 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 629 transitions, 3984 flow [2025-03-17 11:05:58,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 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-17 11:05:58,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:58,546 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:05:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:05:58,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:05:58,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1598599638, now seen corresponding path program 1 times [2025-03-17 11:05:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:58,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346380434] [2025-03-17 11:05:58,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:58,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:58,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1119 statements into 1 equivalence classes. [2025-03-17 11:05:58,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1119 of 1119 statements. [2025-03-17 11:05:58,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:58,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2025-03-17 11:06:01,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:01,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346380434] [2025-03-17 11:06:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346380434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:01,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969422042] [2025-03-17 11:06:01,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:01,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:01,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:01,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:01,788 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-03-17 11:06:01,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 629 transitions, 3984 flow. Second operand has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-17 11:06:01,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:01,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-03-17 11:06:01,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:03,266 INFO L124 PetriNetUnfolderBase]: 1308/5506 cut-off events. [2025-03-17 11:06:03,266 INFO L125 PetriNetUnfolderBase]: For 4888/4945 co-relation queries the response was YES. [2025-03-17 11:06:03,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13385 conditions, 5506 events. 1308/5506 cut-off events. For 4888/4945 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33851 event pairs, 369 based on Foata normal form. 11/5272 useless extension candidates. Maximal degree in co-relation 11796. Up to 2549 conditions per place. [2025-03-17 11:06:03,286 INFO L140 encePairwiseOnDemand]: 267/286 looper letters, 316 selfloop transitions, 84 changer transitions 0/708 dead transitions. [2025-03-17 11:06:03,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 708 transitions, 5182 flow [2025-03-17 11:06:03,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1366 transitions. [2025-03-17 11:06:03,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796037296037296 [2025-03-17 11:06:03,288 INFO L175 Difference]: Start difference. First operand has 351 places, 629 transitions, 3984 flow. Second operand 6 states and 1366 transitions. [2025-03-17 11:06:03,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 708 transitions, 5182 flow [2025-03-17 11:06:03,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 708 transitions, 4928 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-17 11:06:03,334 INFO L231 Difference]: Finished difference. Result has 360 places, 700 transitions, 4520 flow [2025-03-17 11:06:03,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=3736, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4520, PETRI_PLACES=360, PETRI_TRANSITIONS=700} [2025-03-17 11:06:03,335 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 74 predicate places. [2025-03-17 11:06:03,335 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 700 transitions, 4520 flow [2025-03-17 11:06:03,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-17 11:06:03,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:03,336 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:06:03,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:06:03,336 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:03,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash 10528029, now seen corresponding path program 1 times [2025-03-17 11:06:03,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:03,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395744863] [2025-03-17 11:06:03,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:03,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:03,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-03-17 11:06:03,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-03-17 11:06:03,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:03,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2025-03-17 11:06:04,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:04,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395744863] [2025-03-17 11:06:04,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395744863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:04,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:04,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:06:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448917361] [2025-03-17 11:06:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:04,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:06:04,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:04,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:06:04,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:06:04,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 286 [2025-03-17 11:06:04,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 700 transitions, 4520 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-17 11:06:04,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:04,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 286 [2025-03-17 11:06:04,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:04,679 INFO L124 PetriNetUnfolderBase]: 3/1385 cut-off events. [2025-03-17 11:06:04,679 INFO L125 PetriNetUnfolderBase]: For 221/222 co-relation queries the response was YES. [2025-03-17 11:06:04,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 1385 events. 3/1385 cut-off events. For 221/222 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 556 event pairs, 1 based on Foata normal form. 3/1373 useless extension candidates. Maximal degree in co-relation 1489. Up to 51 conditions per place. [2025-03-17 11:06:04,682 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 2 selfloop transitions, 4 changer transitions 0/300 dead transitions. [2025-03-17 11:06:04,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 300 transitions, 1040 flow [2025-03-17 11:06:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:06:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:06:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-03-17 11:06:04,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9813519813519813 [2025-03-17 11:06:04,683 INFO L175 Difference]: Start difference. First operand has 360 places, 700 transitions, 4520 flow. Second operand 3 states and 842 transitions. [2025-03-17 11:06:04,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 300 transitions, 1040 flow [2025-03-17 11:06:04,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 300 transitions, 836 flow, removed 62 selfloop flow, removed 36 redundant places. [2025-03-17 11:06:04,688 INFO L231 Difference]: Finished difference. Result has 322 places, 300 transitions, 832 flow [2025-03-17 11:06:04,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=322, PETRI_TRANSITIONS=300} [2025-03-17 11:06:04,689 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-03-17 11:06:04,689 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 300 transitions, 832 flow [2025-03-17 11:06:04,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 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-17 11:06:04,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:04,690 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:06:04,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:06:04,690 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:04,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:04,693 INFO L85 PathProgramCache]: Analyzing trace with hash -75900710, now seen corresponding path program 1 times [2025-03-17 11:06:04,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:04,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725318225] [2025-03-17 11:06:04,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:04,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1127 statements into 1 equivalence classes. [2025-03-17 11:06:04,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1127 of 1127 statements. [2025-03-17 11:06:04,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:04,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5335 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5335 trivial. 0 not checked. [2025-03-17 11:06:07,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725318225] [2025-03-17 11:06:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725318225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967844955] [2025-03-17 11:06:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:07,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:07,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:08,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-03-17 11:06:08,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 300 transitions, 832 flow. Second operand has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-17 11:06:08,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:08,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-03-17 11:06:08,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:08,250 INFO L124 PetriNetUnfolderBase]: 3/1382 cut-off events. [2025-03-17 11:06:08,250 INFO L125 PetriNetUnfolderBase]: For 137/142 co-relation queries the response was YES. [2025-03-17 11:06:08,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 1382 events. 3/1382 cut-off events. For 137/142 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 543 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1721. Up to 456 conditions per place. [2025-03-17 11:06:08,252 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 74 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-17 11:06:08,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 299 transitions, 988 flow [2025-03-17 11:06:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1304 transitions. [2025-03-17 11:06:08,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599067599067599 [2025-03-17 11:06:08,254 INFO L175 Difference]: Start difference. First operand has 322 places, 300 transitions, 832 flow. Second operand 6 states and 1304 transitions. [2025-03-17 11:06:08,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 299 transitions, 988 flow [2025-03-17 11:06:08,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 299 transitions, 981 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:06:08,258 INFO L231 Difference]: Finished difference. Result has 324 places, 299 transitions, 833 flow [2025-03-17 11:06:08,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=833, PETRI_PLACES=324, PETRI_TRANSITIONS=299} [2025-03-17 11:06:08,258 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 38 predicate places. [2025-03-17 11:06:08,258 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 299 transitions, 833 flow [2025-03-17 11:06:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 0 states have call successors, (0), 0 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-17 11:06:08,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:08,260 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:06:08,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:06:08,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:08,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash -560804354, now seen corresponding path program 1 times [2025-03-17 11:06:08,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:08,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011419115] [2025-03-17 11:06:08,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:08,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1138 statements into 1 equivalence classes. [2025-03-17 11:06:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1138 of 1138 statements. [2025-03-17 11:06:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5336 trivial. 0 not checked. [2025-03-17 11:06:10,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:10,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011419115] [2025-03-17 11:06:10,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011419115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:10,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:10,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973653608] [2025-03-17 11:06:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:10,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:10,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:10,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:11,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 286 [2025-03-17 11:06:11,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 299 transitions, 833 flow. Second operand has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 0 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-17 11:06:11,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:11,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 286 [2025-03-17 11:06:11,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:11,541 INFO L124 PetriNetUnfolderBase]: 5/1413 cut-off events. [2025-03-17 11:06:11,541 INFO L125 PetriNetUnfolderBase]: For 134/135 co-relation queries the response was YES. [2025-03-17 11:06:11,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 1413 events. 5/1413 cut-off events. For 134/135 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 664 event pairs, 3 based on Foata normal form. 0/1403 useless extension candidates. Maximal degree in co-relation 1661. Up to 345 conditions per place. [2025-03-17 11:06:11,544 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 52 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-03-17 11:06:11,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 298 transitions, 945 flow [2025-03-17 11:06:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1419 transitions. [2025-03-17 11:06:11,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2025-03-17 11:06:11,545 INFO L175 Difference]: Start difference. First operand has 324 places, 299 transitions, 833 flow. Second operand 6 states and 1419 transitions. [2025-03-17 11:06:11,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 298 transitions, 945 flow [2025-03-17 11:06:11,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 298 transitions, 935 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:11,550 INFO L231 Difference]: Finished difference. Result has 323 places, 298 transitions, 831 flow [2025-03-17 11:06:11,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=323, PETRI_TRANSITIONS=298} [2025-03-17 11:06:11,550 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 37 predicate places. [2025-03-17 11:06:11,550 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 298 transitions, 831 flow [2025-03-17 11:06:11,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 0 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-17 11:06:11,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:11,551 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:06:11,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:06:11,551 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:11,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash -343876637, now seen corresponding path program 1 times [2025-03-17 11:06:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042253714] [2025-03-17 11:06:11,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:11,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-03-17 11:06:11,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-03-17 11:06:11,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:11,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 5336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5336 trivial. 0 not checked. [2025-03-17 11:06:14,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:14,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042253714] [2025-03-17 11:06:14,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042253714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:14,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:14,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463530143] [2025-03-17 11:06:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:14,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:14,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:14,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:14,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:14,479 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-17 11:06:14,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 298 transitions, 831 flow. Second operand has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 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-17 11:06:14,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:14,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-17 11:06:14,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:14,718 INFO L124 PetriNetUnfolderBase]: 3/1376 cut-off events. [2025-03-17 11:06:14,719 INFO L125 PetriNetUnfolderBase]: For 133/134 co-relation queries the response was YES. [2025-03-17 11:06:14,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1376 events. 3/1376 cut-off events. For 133/134 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 506 event pairs, 1 based on Foata normal form. 0/1373 useless extension candidates. Maximal degree in co-relation 1662. Up to 351 conditions per place. [2025-03-17 11:06:14,724 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 54 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-03-17 11:06:14,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 297 transitions, 947 flow [2025-03-17 11:06:14,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-03-17 11:06:14,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-03-17 11:06:14,725 INFO L175 Difference]: Start difference. First operand has 323 places, 298 transitions, 831 flow. Second operand 6 states and 1409 transitions. [2025-03-17 11:06:14,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 297 transitions, 947 flow [2025-03-17 11:06:14,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 297 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:14,729 INFO L231 Difference]: Finished difference. Result has 322 places, 297 transitions, 829 flow [2025-03-17 11:06:14,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=829, PETRI_PLACES=322, PETRI_TRANSITIONS=297} [2025-03-17 11:06:14,730 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-03-17 11:06:14,730 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 297 transitions, 829 flow [2025-03-17 11:06:14,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 232.5) internal successors, (1395), 6 states have internal predecessors, (1395), 0 states have call successors, (0), 0 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-17 11:06:14,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:14,731 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:06:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:06:14,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:14,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:14,734 INFO L85 PathProgramCache]: Analyzing trace with hash -189068949, now seen corresponding path program 1 times [2025-03-17 11:06:14,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:14,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532402553] [2025-03-17 11:06:14,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:14,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:14,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-03-17 11:06:14,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-03-17 11:06:14,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:14,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5341 trivial. 0 not checked. [2025-03-17 11:06:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532402553] [2025-03-17 11:06:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532402553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061823490] [2025-03-17 11:06:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:17,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:17,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:17,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-03-17 11:06:17,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 297 transitions, 829 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 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-17 11:06:17,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:17,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-03-17 11:06:17,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:17,969 INFO L124 PetriNetUnfolderBase]: 3/1373 cut-off events. [2025-03-17 11:06:17,969 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-03-17 11:06:17,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 1373 events. 3/1373 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 491 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1802. Up to 473 conditions per place. [2025-03-17 11:06:17,971 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 80 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2025-03-17 11:06:17,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 296 transitions, 997 flow [2025-03-17 11:06:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-03-17 11:06:17,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-03-17 11:06:17,972 INFO L175 Difference]: Start difference. First operand has 322 places, 297 transitions, 829 flow. Second operand 6 states and 1279 transitions. [2025-03-17 11:06:17,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 296 transitions, 997 flow [2025-03-17 11:06:17,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 296 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:17,976 INFO L231 Difference]: Finished difference. Result has 321 places, 296 transitions, 827 flow [2025-03-17 11:06:17,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=827, PETRI_PLACES=321, PETRI_TRANSITIONS=296} [2025-03-17 11:06:17,977 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 35 predicate places. [2025-03-17 11:06:17,977 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 296 transitions, 827 flow [2025-03-17 11:06:17,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 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-17 11:06:17,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:17,977 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:06:17,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:06:17,977 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-17 11:06:17,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1891630993, now seen corresponding path program 1 times [2025-03-17 11:06:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065072466] [2025-03-17 11:06:17,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:06:17,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:18,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1165 statements into 1 equivalence classes. [2025-03-17 11:06:18,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1165 of 1165 statements. [2025-03-17 11:06:18,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:18,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5341 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5341 trivial. 0 not checked. [2025-03-17 11:06:20,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:20,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065072466] [2025-03-17 11:06:20,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065072466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:06:20,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:06:20,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:06:20,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108007255] [2025-03-17 11:06:20,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:06:20,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:06:20,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:20,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:06:20,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:06:20,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-03-17 11:06:20,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 296 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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-17 11:06:20,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:20,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-03-17 11:06:20,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:21,159 INFO L124 PetriNetUnfolderBase]: 3/1370 cut-off events. [2025-03-17 11:06:21,159 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-03-17 11:06:21,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2030 conditions, 1370 events. 3/1370 cut-off events. For 135/140 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 474 event pairs, 1 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 1841. Up to 470 conditions per place. [2025-03-17 11:06:21,161 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 0 selfloop transitions, 0 changer transitions 295/295 dead transitions. [2025-03-17 11:06:21,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 295 transitions, 993 flow [2025-03-17 11:06:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:06:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:06:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-03-17 11:06:21,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-03-17 11:06:21,163 INFO L175 Difference]: Start difference. First operand has 321 places, 296 transitions, 827 flow. Second operand 6 states and 1284 transitions. [2025-03-17 11:06:21,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 295 transitions, 993 flow [2025-03-17 11:06:21,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 295 transitions, 983 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:06:21,168 INFO L231 Difference]: Finished difference. Result has 320 places, 0 transitions, 0 flow [2025-03-17 11:06:21,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=320, PETRI_TRANSITIONS=0} [2025-03-17 11:06:21,169 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 34 predicate places. [2025-03-17 11:06:21,169 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 0 transitions, 0 flow [2025-03-17 11:06:21,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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-17 11:06:21,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2025-03-17 11:06:21,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-03-17 11:06:21,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-03-17 11:06:21,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-03-17 11:06:21,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-03-17 11:06:21,171 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-03-17 11:06:21,172 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-03-17 11:06:21,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:06:21,172 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:06:21,176 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:06:21,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:06:21,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:06:21 BasicIcfg [2025-03-17 11:06:21,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:06:21,181 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:06:21,181 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:06:21,181 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:06:21,181 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:05:39" (3/4) ... [2025-03-17 11:06:21,182 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:06:21,184 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-17 11:06:21,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-17 11:06:21,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:06:21,188 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 11:06:21,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:06:21,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:06:21,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:06:21,252 INFO L158 Benchmark]: Toolchain (without parser) took 43035.37ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 110.3MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 968.8MB. Max. memory is 16.1GB. [2025-03-17 11:06:21,252 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:06:21,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.67ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 71.2MB in the end (delta: 39.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 11:06:21,253 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.31ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 67.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:06:21,253 INFO L158 Benchmark]: Boogie Preprocessor took 27.29ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 64.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:06:21,253 INFO L158 Benchmark]: IcfgBuilder took 587.14ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 96.9MB in the end (delta: -32.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2025-03-17 11:06:21,254 INFO L158 Benchmark]: TraceAbstraction took 41860.17ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 96.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 944.3MB. Max. memory is 16.1GB. [2025-03-17 11:06:21,254 INFO L158 Benchmark]: Witness Printer took 70.17ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:06:21,254 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.67ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 71.2MB in the end (delta: 39.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.31ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 67.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.29ms. Allocated memory is still 142.6MB. Free memory was 67.1MB in the beginning and 64.3MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 587.14ms. Allocated memory is still 142.6MB. Free memory was 64.3MB in the beginning and 96.9MB in the end (delta: -32.5MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41860.17ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 96.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 944.3MB. Max. memory is 16.1GB. * Witness Printer took 70.17ms. Allocated memory is still 2.5GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1264]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1265]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1259]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1260]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1234]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1235]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1249]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1239]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1240]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1241]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 375 locations, 377 edges, 25 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.7s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4836 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3108 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 429 mSDsCounter, 931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9760 IncrementalHoareTripleChecker+Invalid, 10691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 931 mSolverCounterUnsat, 34 mSDtfsCounter, 9760 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2827 GetRequests, 2671 SyntacticMatches, 11 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4520occurred in iteration=15, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.4s InterpolantComputationTime, 13636 NumberOfCodeBlocks, 11536 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14942 ConstructedInterpolants, 0 QuantifiedInterpolants, 23474 SizeOfPredicates, 22 NumberOfNonLiveVariables, 5137 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 45728/54185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:06:21,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE