./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 f8ab0bd5 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-?-f8ab0bd-m [2025-03-13 22:16:59,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:16:59,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:16:59,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:16:59,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:16:59,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:16:59,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:16:59,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:16:59,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:16:59,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:16:59,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:16:59,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:16:59,628 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:16:59,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:16:59,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:16:59,628 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:16:59,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:16:59,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:16:59,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:16:59,629 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:16:59,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:16:59,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:16:59,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:16:59,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:16:59,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:16:59,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:16:59,631 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-13 22:16:59,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:16:59,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:16:59,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:16:59,855 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:16:59,855 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:16:59,857 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-13 22:17:01,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cb775a66/d3cdd43aa07548a9b0f737c9b507f88d/FLAG3b25abbf7 [2025-03-13 22:17:01,267 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:17:01,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist.i [2025-03-13 22:17:01,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cb775a66/d3cdd43aa07548a9b0f737c9b507f88d/FLAG3b25abbf7 [2025-03-13 22:17:01,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cb775a66/d3cdd43aa07548a9b0f737c9b507f88d [2025-03-13 22:17:01,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:17:01,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:17:01,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:01,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:17:01,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:17:01,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:01" (1/1) ... [2025-03-13 22:17:01,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53c85948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:01, skipping insertion in model container [2025-03-13 22:17:01,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:01" (1/1) ... [2025-03-13 22:17:01,601 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:17:01,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:01,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:17:01,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:02,018 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:17:02,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02 WrapperNode [2025-03-13 22:17:02,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:02,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:02,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:17:02,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:17:02,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,070 INFO L138 Inliner]: procedures = 372, calls = 43, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 242 [2025-03-13 22:17:02,071 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:02,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:17:02,072 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:17:02,072 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:17:02,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,113 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:17:02,114 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:17:02,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:17:02,114 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:17:02,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (1/1) ... [2025-03-13 22:17:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:02,142 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-13 22:17:02,144 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-13 22:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:17:02,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:17:02,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:17:02,161 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:17:02,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:17:02,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:17:02,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:17:02,162 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:17:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:17:02,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:17:02,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:17:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:17:02,163 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:17:02,290 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:17:02,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:17:02,733 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:17:02,734 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:17:02,734 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:17:02,762 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:17:02,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:02 BoogieIcfgContainer [2025-03-13 22:17:02,762 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:17:02,764 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:17:02,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:17:02,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:17:02,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:17:01" (1/3) ... [2025-03-13 22:17:02,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b89517a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:02, skipping insertion in model container [2025-03-13 22:17:02,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:02" (2/3) ... [2025-03-13 22:17:02,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b89517a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:02, skipping insertion in model container [2025-03-13 22:17:02,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:02" (3/3) ... [2025-03-13 22:17:02,772 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist.i [2025-03-13 22:17:02,781 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:17:02,783 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-13 22:17:02,784 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:17:02,878 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:17:02,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 287 places, 286 transitions, 576 flow [2025-03-13 22:17:02,980 INFO L124 PetriNetUnfolderBase]: 3/285 cut-off events. [2025-03-13 22:17:02,982 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:02,986 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-13 22:17:02,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 287 places, 286 transitions, 576 flow [2025-03-13 22:17:02,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 285 transitions, 573 flow [2025-03-13 22:17:03,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:17:03,010 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;@78139615, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:17:03,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-13 22:17:03,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:17:03,022 INFO L124 PetriNetUnfolderBase]: 1/75 cut-off events. [2025-03-13 22:17:03,022 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:03,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:03,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 22:17:03,023 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-13 22:17:03,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash 201734489, now seen corresponding path program 1 times [2025-03-13 22:17:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:03,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825632412] [2025-03-13 22:17:03,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:03,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:03,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-13 22:17:03,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-13 22:17:03,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:03,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:03,695 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-13 22:17:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825632412] [2025-03-13 22:17:03,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825632412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:03,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:03,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:03,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210870191] [2025-03-13 22:17:03,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:03,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:03,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:04,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-03-13 22:17:04,129 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-13 22:17:04,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:04,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-03-13 22:17:04,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:04,329 INFO L124 PetriNetUnfolderBase]: 365/1634 cut-off events. [2025-03-13 22:17:04,329 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:04,333 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 10047 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-13 22:17:04,338 INFO L140 encePairwiseOnDemand]: 272/286 looper letters, 71 selfloop transitions, 10 changer transitions 1/281 dead transitions. [2025-03-13 22:17:04,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 727 flow [2025-03-13 22:17:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1291 transitions. [2025-03-13 22:17:04,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7523310023310024 [2025-03-13 22:17:04,352 INFO L175 Difference]: Start difference. First operand has 286 places, 285 transitions, 573 flow. Second operand 6 states and 1291 transitions. [2025-03-13 22:17:04,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 727 flow [2025-03-13 22:17:04,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 281 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:04,361 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 582 flow [2025-03-13 22:17:04,364 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-13 22:17:04,367 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-03-13 22:17:04,367 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 582 flow [2025-03-13 22:17:04,368 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-13 22:17:04,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:04,368 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-13 22:17:04,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:17:04,369 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-13 22:17:04,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:04,370 INFO L85 PathProgramCache]: Analyzing trace with hash -134879796, now seen corresponding path program 1 times [2025-03-13 22:17:04,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:04,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046224845] [2025-03-13 22:17:04,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:04,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-13 22:17:04,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-13 22:17:04,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:04,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:04,427 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-13 22:17:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046224845] [2025-03-13 22:17:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046224845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:04,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:04,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:04,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618968891] [2025-03-13 22:17:04,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:04,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:04,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:04,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:04,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 286 [2025-03-13 22:17:04,461 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-13 22:17:04,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:04,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 286 [2025-03-13 22:17:04,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:04,532 INFO L124 PetriNetUnfolderBase]: 7/467 cut-off events. [2025-03-13 22:17:04,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:04,534 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 873 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-13 22:17:04,535 INFO L140 encePairwiseOnDemand]: 283/286 looper letters, 10 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2025-03-13 22:17:04,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 281 transitions, 608 flow [2025-03-13 22:17:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:04,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 832 transitions. [2025-03-13 22:17:04,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-13 22:17:04,538 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 582 flow. Second operand 3 states and 832 transitions. [2025-03-13 22:17:04,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 281 transitions, 608 flow [2025-03-13 22:17:04,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:04,548 INFO L231 Difference]: Finished difference. Result has 285 places, 281 transitions, 574 flow [2025-03-13 22:17:04,548 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-13 22:17:04,549 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-03-13 22:17:04,549 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 281 transitions, 574 flow [2025-03-13 22:17:04,549 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-13 22:17:04,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:04,549 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-13 22:17:04,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:17:04,549 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-13 22:17:04,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:04,550 INFO L85 PathProgramCache]: Analyzing trace with hash 457912700, now seen corresponding path program 1 times [2025-03-13 22:17:04,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:04,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117306501] [2025-03-13 22:17:04,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:04,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:04,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:17:04,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:17:04,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:04,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:04,802 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-13 22:17:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117306501] [2025-03-13 22:17:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117306501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:04,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:04,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:04,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540318417] [2025-03-13 22:17:04,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:04,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:04,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:04,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:04,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:05,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 286 [2025-03-13 22:17:05,164 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-13 22:17:05,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:05,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 286 [2025-03-13 22:17:05,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:05,417 INFO L124 PetriNetUnfolderBase]: 365/1740 cut-off events. [2025-03-13 22:17:05,418 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:05,419 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 9974 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-13 22:17:05,423 INFO L140 encePairwiseOnDemand]: 274/286 looper letters, 71 selfloop transitions, 10 changer transitions 0/279 dead transitions. [2025-03-13 22:17:05,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 279 transitions, 732 flow [2025-03-13 22:17:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1289 transitions. [2025-03-13 22:17:05,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511655011655012 [2025-03-13 22:17:05,426 INFO L175 Difference]: Start difference. First operand has 285 places, 281 transitions, 574 flow. Second operand 6 states and 1289 transitions. [2025-03-13 22:17:05,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 279 transitions, 732 flow [2025-03-13 22:17:05,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 279 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:05,430 INFO L231 Difference]: Finished difference. Result has 287 places, 279 transitions, 588 flow [2025-03-13 22:17:05,430 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-13 22:17:05,431 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 1 predicate places. [2025-03-13 22:17:05,431 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 279 transitions, 588 flow [2025-03-13 22:17:05,431 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-13 22:17:05,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:05,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:05,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:17:05,432 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-13 22:17:05,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash -976369191, now seen corresponding path program 1 times [2025-03-13 22:17:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:05,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821550007] [2025-03-13 22:17:05,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:05,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 22:17:05,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 22:17:05,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:05,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:05,762 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-13 22:17:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821550007] [2025-03-13 22:17:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821550007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:05,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:05,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433611724] [2025-03-13 22:17:05,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:05,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:05,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:05,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:06,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 286 [2025-03-13 22:17:06,109 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-13 22:17:06,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:06,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 286 [2025-03-13 22:17:06,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:06,363 INFO L124 PetriNetUnfolderBase]: 391/1828 cut-off events. [2025-03-13 22:17:06,364 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 22:17:06,367 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 10762 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-13 22:17:06,371 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 83 selfloop transitions, 5 changer transitions 0/278 dead transitions. [2025-03-13 22:17:06,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 278 transitions, 762 flow [2025-03-13 22:17:06,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1264 transitions. [2025-03-13 22:17:06,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7365967365967366 [2025-03-13 22:17:06,374 INFO L175 Difference]: Start difference. First operand has 287 places, 279 transitions, 588 flow. Second operand 6 states and 1264 transitions. [2025-03-13 22:17:06,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 278 transitions, 762 flow [2025-03-13 22:17:06,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 278 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:06,379 INFO L231 Difference]: Finished difference. Result has 286 places, 278 transitions, 576 flow [2025-03-13 22:17:06,380 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-13 22:17:06,380 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 0 predicate places. [2025-03-13 22:17:06,381 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 278 transitions, 576 flow [2025-03-13 22:17:06,382 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-13 22:17:06,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:06,382 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-13 22:17:06,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:17:06,382 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-13 22:17:06,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:06,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1930103438, now seen corresponding path program 1 times [2025-03-13 22:17:06,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:06,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531530020] [2025-03-13 22:17:06,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:06,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-13 22:17:06,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-13 22:17:06,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:06,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:06,809 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-13 22:17:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531530020] [2025-03-13 22:17:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531530020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:06,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:06,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967941412] [2025-03-13 22:17:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:06,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:06,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:06,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:06,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:07,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 286 [2025-03-13 22:17:07,306 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-13 22:17:07,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:07,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 286 [2025-03-13 22:17:07,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:07,426 INFO L124 PetriNetUnfolderBase]: 55/702 cut-off events. [2025-03-13 22:17:07,426 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:17:07,427 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 2667 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-13 22:17:07,429 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 57 selfloop transitions, 5 changer transitions 0/277 dead transitions. [2025-03-13 22:17:07,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 277 transitions, 698 flow [2025-03-13 22:17:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2025-03-13 22:17:07,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8123543123543123 [2025-03-13 22:17:07,434 INFO L175 Difference]: Start difference. First operand has 286 places, 278 transitions, 576 flow. Second operand 6 states and 1394 transitions. [2025-03-13 22:17:07,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 277 transitions, 698 flow [2025-03-13 22:17:07,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 277 transitions, 688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:07,439 INFO L231 Difference]: Finished difference. Result has 285 places, 277 transitions, 574 flow [2025-03-13 22:17:07,439 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-13 22:17:07,440 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -1 predicate places. [2025-03-13 22:17:07,440 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 277 transitions, 574 flow [2025-03-13 22:17:07,442 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-13 22:17:07,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:07,443 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-13 22:17:07,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:17:07,445 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-13 22:17:07,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:07,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2069327791, now seen corresponding path program 1 times [2025-03-13 22:17:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:07,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152460520] [2025-03-13 22:17:07,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:07,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-13 22:17:07,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-13 22:17:07,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:07,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:07,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152460520] [2025-03-13 22:17:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152460520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467779783] [2025-03-13 22:17:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:07,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:07,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:07,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:07,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:08,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-13 22:17:08,243 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-13 22:17:08,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:08,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-13 22:17:08,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:08,339 INFO L124 PetriNetUnfolderBase]: 37/617 cut-off events. [2025-03-13 22:17:08,339 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:17:08,340 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 2090 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-13 22:17:08,341 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 53 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2025-03-13 22:17:08,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 276 transitions, 688 flow [2025-03-13 22:17:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-03-13 22:17:08,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-03-13 22:17:08,344 INFO L175 Difference]: Start difference. First operand has 285 places, 277 transitions, 574 flow. Second operand 6 states and 1409 transitions. [2025-03-13 22:17:08,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 276 transitions, 688 flow [2025-03-13 22:17:08,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 276 transitions, 678 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:08,347 INFO L231 Difference]: Finished difference. Result has 284 places, 276 transitions, 572 flow [2025-03-13 22:17:08,347 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-13 22:17:08,349 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -2 predicate places. [2025-03-13 22:17:08,350 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 276 transitions, 572 flow [2025-03-13 22:17:08,350 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-13 22:17:08,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:08,350 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-13 22:17:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:17:08,351 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-13 22:17:08,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1615578824, now seen corresponding path program 1 times [2025-03-13 22:17:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:08,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200777606] [2025-03-13 22:17:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:08,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-13 22:17:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-13 22:17:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:17:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200777606] [2025-03-13 22:17:08,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200777606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:08,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716723666] [2025-03-13 22:17:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:08,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:08,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:08,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:08,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-03-13 22:17:08,885 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-13 22:17:08,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:08,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-03-13 22:17:08,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:09,018 INFO L124 PetriNetUnfolderBase]: 365/1732 cut-off events. [2025-03-13 22:17:09,018 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:17:09,021 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 9958 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-13 22:17:09,025 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 79 selfloop transitions, 5 changer transitions 0/275 dead transitions. [2025-03-13 22:17:09,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 275 transitions, 738 flow [2025-03-13 22:17:09,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-03-13 22:17:09,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-03-13 22:17:09,028 INFO L175 Difference]: Start difference. First operand has 284 places, 276 transitions, 572 flow. Second operand 6 states and 1279 transitions. [2025-03-13 22:17:09,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 275 transitions, 738 flow [2025-03-13 22:17:09,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 275 transitions, 728 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:09,031 INFO L231 Difference]: Finished difference. Result has 283 places, 275 transitions, 570 flow [2025-03-13 22:17:09,032 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-13 22:17:09,033 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -3 predicate places. [2025-03-13 22:17:09,033 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 275 transitions, 570 flow [2025-03-13 22:17:09,034 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-13 22:17:09,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:09,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:09,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:17:09,035 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-13 22:17:09,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1189061414, now seen corresponding path program 1 times [2025-03-13 22:17:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:09,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318392604] [2025-03-13 22:17:09,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:09,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:17:09,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:17:09,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:09,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:17:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:09,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318392604] [2025-03-13 22:17:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318392604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:09,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149995195] [2025-03-13 22:17:09,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:09,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:09,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:09,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:09,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-03-13 22:17:09,583 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-13 22:17:09,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:09,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-03-13 22:17:09,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:09,767 INFO L124 PetriNetUnfolderBase]: 365/1730 cut-off events. [2025-03-13 22:17:09,767 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:17:09,769 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 9919 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-13 22:17:09,772 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 78 selfloop transitions, 5 changer transitions 0/274 dead transitions. [2025-03-13 22:17:09,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 274 transitions, 734 flow [2025-03-13 22:17:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-03-13 22:17:09,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-03-13 22:17:09,775 INFO L175 Difference]: Start difference. First operand has 283 places, 275 transitions, 570 flow. Second operand 6 states and 1284 transitions. [2025-03-13 22:17:09,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 274 transitions, 734 flow [2025-03-13 22:17:09,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 274 transitions, 724 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:09,778 INFO L231 Difference]: Finished difference. Result has 282 places, 274 transitions, 568 flow [2025-03-13 22:17:09,778 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-13 22:17:09,779 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -4 predicate places. [2025-03-13 22:17:09,779 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 274 transitions, 568 flow [2025-03-13 22:17:09,779 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-13 22:17:09,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:09,780 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-13 22:17:09,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:17:09,780 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-13 22:17:09,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash 141307069, now seen corresponding path program 1 times [2025-03-13 22:17:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:09,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368249564] [2025-03-13 22:17:09,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:09,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:09,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-13 22:17:09,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-13 22:17:09,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:09,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 22:17:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368249564] [2025-03-13 22:17:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368249564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726500416] [2025-03-13 22:17:09,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:09,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:09,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:09,923 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-13 22:17:09,924 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-13 22:17:10,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-13 22:17:10,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-13 22:17:10,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:10,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:10,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:17:10,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 22:17:10,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 22:17:10,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726500416] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:10,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:17:10,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547503538] [2025-03-13 22:17:10,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:10,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:17:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:10,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:17:10,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:17:10,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-03-13 22:17:10,496 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-13 22:17:10,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:10,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-03-13 22:17:10,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:10,583 INFO L124 PetriNetUnfolderBase]: 7/560 cut-off events. [2025-03-13 22:17:10,583 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:10,584 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 397 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-13 22:17:10,585 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 14 selfloop transitions, 9 changer transitions 0/282 dead transitions. [2025-03-13 22:17:10,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 282 transitions, 632 flow [2025-03-13 22:17:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:17:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:17:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2455 transitions. [2025-03-13 22:17:10,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9537684537684538 [2025-03-13 22:17:10,588 INFO L175 Difference]: Start difference. First operand has 282 places, 274 transitions, 568 flow. Second operand 9 states and 2455 transitions. [2025-03-13 22:17:10,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 282 transitions, 632 flow [2025-03-13 22:17:10,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 282 transitions, 622 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:10,591 INFO L231 Difference]: Finished difference. Result has 288 places, 280 transitions, 608 flow [2025-03-13 22:17:10,592 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-13 22:17:10,592 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 2 predicate places. [2025-03-13 22:17:10,592 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 280 transitions, 608 flow [2025-03-13 22:17:10,593 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-13 22:17:10,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:10,594 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-13 22:17:10,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:17:10,794 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-13 22:17:10,794 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-13 22:17:10,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash 44524957, now seen corresponding path program 2 times [2025-03-13 22:17:10,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:10,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792576424] [2025-03-13 22:17:10,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:10,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:10,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 367 statements into 2 equivalence classes. [2025-03-13 22:17:10,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 52 of 367 statements. [2025-03-13 22:17:10,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:10,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2025-03-13 22:17:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:11,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792576424] [2025-03-13 22:17:11,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792576424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:11,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:11,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:11,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767758139] [2025-03-13 22:17:11,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:11,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:11,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:11,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:11,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-13 22:17:11,506 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-13 22:17:11,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:11,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-13 22:17:11,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:11,907 INFO L124 PetriNetUnfolderBase]: 257/1877 cut-off events. [2025-03-13 22:17:11,907 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:17:11,909 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 10104 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-13 22:17:11,913 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 67 selfloop transitions, 70 changer transitions 0/358 dead transitions. [2025-03-13 22:17:11,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 358 transitions, 1038 flow [2025-03-13 22:17:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-03-13 22:17:11,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-03-13 22:17:11,916 INFO L175 Difference]: Start difference. First operand has 288 places, 280 transitions, 608 flow. Second operand 6 states and 1488 transitions. [2025-03-13 22:17:11,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 358 transitions, 1038 flow [2025-03-13 22:17:11,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 358 transitions, 1032 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:11,921 INFO L231 Difference]: Finished difference. Result has 297 places, 349 transitions, 1064 flow [2025-03-13 22:17:11,921 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-13 22:17:11,922 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 11 predicate places. [2025-03-13 22:17:11,922 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 349 transitions, 1064 flow [2025-03-13 22:17:11,923 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-13 22:17:11,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:11,923 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-13 22:17:11,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:17:11,923 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-13 22:17:11,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 904729825, now seen corresponding path program 1 times [2025-03-13 22:17:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800397749] [2025-03-13 22:17:11,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:11,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-13 22:17:11,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-13 22:17:11,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:11,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-13 22:17:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800397749] [2025-03-13 22:17:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800397749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171300325] [2025-03-13 22:17:12,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:12,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:12,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:12,282 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-13 22:17:12,284 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-13 22:17:12,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-13 22:17:12,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-13 22:17:12,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:12,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:12,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:17:12,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-13 22:17:12,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-13 22:17:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171300325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:13,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:13,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:17:13,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009367641] [2025-03-13 22:17:13,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:13,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:17:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:13,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:17:13,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:17:13,388 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-03-13 22:17:13,391 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-13 22:17:13,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:13,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-03-13 22:17:13,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:13,847 INFO L124 PetriNetUnfolderBase]: 159/1999 cut-off events. [2025-03-13 22:17:13,847 INFO L125 PetriNetUnfolderBase]: For 184/198 co-relation queries the response was YES. [2025-03-13 22:17:13,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 1999 events. 159/1999 cut-off events. For 184/198 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7409 event pairs, 23 based on Foata normal form. 4/1917 useless extension candidates. Maximal degree in co-relation 1862. Up to 207 conditions per place. [2025-03-13 22:17:13,853 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 19 selfloop transitions, 21 changer transitions 0/367 dead transitions. [2025-03-13 22:17:13,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 367 transitions, 1232 flow [2025-03-13 22:17:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:17:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:17:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5713 transitions. [2025-03-13 22:17:13,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9512154512154513 [2025-03-13 22:17:13,863 INFO L175 Difference]: Start difference. First operand has 297 places, 349 transitions, 1064 flow. Second operand 21 states and 5713 transitions. [2025-03-13 22:17:13,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 367 transitions, 1232 flow [2025-03-13 22:17:13,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 367 transitions, 1232 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:13,873 INFO L231 Difference]: Finished difference. Result has 322 places, 362 transitions, 1194 flow [2025-03-13 22:17:13,873 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-13 22:17:13,874 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-03-13 22:17:13,874 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 362 transitions, 1194 flow [2025-03-13 22:17:13,875 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-13 22:17:13,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:13,876 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-13 22:17:13,886 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-13 22:17:14,077 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-13 22:17:14,077 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-13 22:17:14,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1077227871, now seen corresponding path program 2 times [2025-03-13 22:17:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:14,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438099887] [2025-03-13 22:17:14,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:14,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 793 statements into 2 equivalence classes. [2025-03-13 22:17:14,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 793 statements. [2025-03-13 22:17:14,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:14,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3241 trivial. 0 not checked. [2025-03-13 22:17:14,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438099887] [2025-03-13 22:17:14,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438099887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:14,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:14,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412189499] [2025-03-13 22:17:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:14,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:14,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:14,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:14,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-13 22:17:14,670 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-13 22:17:14,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:14,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-13 22:17:14,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:15,376 INFO L124 PetriNetUnfolderBase]: 545/3096 cut-off events. [2025-03-13 22:17:15,377 INFO L125 PetriNetUnfolderBase]: For 850/943 co-relation queries the response was YES. [2025-03-13 22:17:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5420 conditions, 3096 events. 545/3096 cut-off events. For 850/943 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16098 event pairs, 93 based on Foata normal form. 16/2947 useless extension candidates. Maximal degree in co-relation 4359. Up to 981 conditions per place. [2025-03-13 22:17:15,387 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 131 selfloop transitions, 130 changer transitions 0/499 dead transitions. [2025-03-13 22:17:15,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 499 transitions, 2366 flow [2025-03-13 22:17:15,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:15,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2025-03-13 22:17:15,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8665501165501166 [2025-03-13 22:17:15,390 INFO L175 Difference]: Start difference. First operand has 322 places, 362 transitions, 1194 flow. Second operand 6 states and 1487 transitions. [2025-03-13 22:17:15,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 499 transitions, 2366 flow [2025-03-13 22:17:15,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 499 transitions, 2342 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:17:15,398 INFO L231 Difference]: Finished difference. Result has 326 places, 491 transitions, 2398 flow [2025-03-13 22:17:15,398 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-13 22:17:15,399 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 40 predicate places. [2025-03-13 22:17:15,399 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 491 transitions, 2398 flow [2025-03-13 22:17:15,399 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-13 22:17:15,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:15,400 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-13 22:17:15,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:17:15,400 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-13 22:17:15,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -755594938, now seen corresponding path program 1 times [2025-03-13 22:17:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:15,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595395861] [2025-03-13 22:17:15,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:15,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-03-13 22:17:15,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-03-13 22:17:15,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:15,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 3094 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-13 22:17:16,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595395861] [2025-03-13 22:17:16,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595395861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:16,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372184927] [2025-03-13 22:17:16,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:16,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:16,902 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-13 22:17:16,904 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-13 22:17:17,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 803 statements into 1 equivalence classes. [2025-03-13 22:17:17,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 803 of 803 statements. [2025-03-13 22:17:17,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:17,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:17,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 3147 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:17:17,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 3094 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-13 22:17:18,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3241 backedges. 0 proven. 3094 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-13 22:17:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372184927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:18,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:17:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145818333] [2025-03-13 22:17:18,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:18,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:17:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:18,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:17:18,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:17:18,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 286 [2025-03-13 22:17:18,895 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-13 22:17:18,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:18,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 286 [2025-03-13 22:17:18,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:19,658 INFO L124 PetriNetUnfolderBase]: 420/3101 cut-off events. [2025-03-13 22:17:19,658 INFO L125 PetriNetUnfolderBase]: For 1170/1200 co-relation queries the response was YES. [2025-03-13 22:17:19,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 3101 events. 420/3101 cut-off events. For 1170/1200 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13560 event pairs, 39 based on Foata normal form. 7/3000 useless extension candidates. Maximal degree in co-relation 4085. Up to 468 conditions per place. [2025-03-13 22:17:19,669 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 22 selfloop transitions, 30 changer transitions 0/508 dead transitions. [2025-03-13 22:17:19,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 508 transitions, 2624 flow [2025-03-13 22:17:19,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:17:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:17:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8154 transitions. [2025-03-13 22:17:19,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503496503496504 [2025-03-13 22:17:19,676 INFO L175 Difference]: Start difference. First operand has 326 places, 491 transitions, 2398 flow. Second operand 30 states and 8154 transitions. [2025-03-13 22:17:19,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 508 transitions, 2624 flow [2025-03-13 22:17:19,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 508 transitions, 2624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:19,688 INFO L231 Difference]: Finished difference. Result has 359 places, 501 transitions, 2550 flow [2025-03-13 22:17:19,688 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-13 22:17:19,689 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 73 predicate places. [2025-03-13 22:17:19,689 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 501 transitions, 2550 flow [2025-03-13 22:17:19,691 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-13 22:17:19,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:19,692 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-13 22:17:19,703 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-13 22:17:19,892 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-13 22:17:19,892 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-13 22:17:19,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 449423701, now seen corresponding path program 2 times [2025-03-13 22:17:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270466996] [2025-03-13 22:17:19,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:20,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1118 statements into 2 equivalence classes. [2025-03-13 22:17:20,017 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 1118 statements. [2025-03-13 22:17:20,017 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:20,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-03-13 22:17:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:20,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270466996] [2025-03-13 22:17:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270466996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:20,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:20,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844020390] [2025-03-13 22:17:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:20,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:20,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:20,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:20,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-13 22:17:20,486 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-13 22:17:20,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:20,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-13 22:17:20,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:21,592 INFO L124 PetriNetUnfolderBase]: 821/4177 cut-off events. [2025-03-13 22:17:21,592 INFO L125 PetriNetUnfolderBase]: For 3302/3537 co-relation queries the response was YES. [2025-03-13 22:17:21,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8767 conditions, 4177 events. 821/4177 cut-off events. For 3302/3537 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22434 event pairs, 74 based on Foata normal form. 76/4078 useless extension candidates. Maximal degree in co-relation 7239. Up to 1323 conditions per place. [2025-03-13 22:17:21,608 INFO L140 encePairwiseOnDemand]: 263/286 looper letters, 251 selfloop transitions, 131 changer transitions 5/639 dead transitions. [2025-03-13 22:17:21,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 639 transitions, 4224 flow [2025-03-13 22:17:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1488 transitions. [2025-03-13 22:17:21,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671328671328671 [2025-03-13 22:17:21,609 INFO L175 Difference]: Start difference. First operand has 359 places, 501 transitions, 2550 flow. Second operand 6 states and 1488 transitions. [2025-03-13 22:17:21,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 639 transitions, 4224 flow [2025-03-13 22:17:21,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 639 transitions, 4178 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:17:21,622 INFO L231 Difference]: Finished difference. Result has 351 places, 629 transitions, 3984 flow [2025-03-13 22:17:21,623 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-13 22:17:21,623 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 65 predicate places. [2025-03-13 22:17:21,623 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 629 transitions, 3984 flow [2025-03-13 22:17:21,623 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-13 22:17:21,624 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:21,624 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-13 22:17:21,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:17:21,624 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-13 22:17:21,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1943527557, now seen corresponding path program 1 times [2025-03-13 22:17:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:21,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707851043] [2025-03-13 22:17:21,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:21,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1119 statements into 1 equivalence classes. [2025-03-13 22:17:21,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1119 of 1119 statements. [2025-03-13 22:17:21,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:21,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-03-13 22:17:24,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:24,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707851043] [2025-03-13 22:17:24,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707851043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:24,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:24,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:24,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572049059] [2025-03-13 22:17:24,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:24,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:24,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:24,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:24,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-03-13 22:17:24,647 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-13 22:17:24,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:24,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-03-13 22:17:24,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:26,228 INFO L124 PetriNetUnfolderBase]: 1308/5506 cut-off events. [2025-03-13 22:17:26,229 INFO L125 PetriNetUnfolderBase]: For 4888/4945 co-relation queries the response was YES. [2025-03-13 22:17:26,239 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 33873 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-13 22:17:26,250 INFO L140 encePairwiseOnDemand]: 267/286 looper letters, 316 selfloop transitions, 84 changer transitions 0/708 dead transitions. [2025-03-13 22:17:26,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 708 transitions, 5182 flow [2025-03-13 22:17:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1366 transitions. [2025-03-13 22:17:26,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796037296037296 [2025-03-13 22:17:26,252 INFO L175 Difference]: Start difference. First operand has 351 places, 629 transitions, 3984 flow. Second operand 6 states and 1366 transitions. [2025-03-13 22:17:26,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 708 transitions, 5182 flow [2025-03-13 22:17:26,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 708 transitions, 4928 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:26,274 INFO L231 Difference]: Finished difference. Result has 360 places, 700 transitions, 4520 flow [2025-03-13 22:17:26,274 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-13 22:17:26,275 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 74 predicate places. [2025-03-13 22:17:26,275 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 700 transitions, 4520 flow [2025-03-13 22:17:26,275 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-13 22:17:26,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:26,276 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-13 22:17:26,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:17:26,276 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-13 22:17:26,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash -455258244, now seen corresponding path program 1 times [2025-03-13 22:17:26,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:26,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205181890] [2025-03-13 22:17:26,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:26,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-03-13 22:17:26,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-03-13 22:17:26,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:26,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-03-13 22:17:27,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:27,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205181890] [2025-03-13 22:17:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205181890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:27,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:27,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:27,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42224328] [2025-03-13 22:17:27,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:27,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:27,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:27,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:27,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 286 [2025-03-13 22:17:27,339 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-13 22:17:27,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:27,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 286 [2025-03-13 22:17:27,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:27,547 INFO L124 PetriNetUnfolderBase]: 3/1385 cut-off events. [2025-03-13 22:17:27,547 INFO L125 PetriNetUnfolderBase]: For 221/222 co-relation queries the response was YES. [2025-03-13 22:17:27,549 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-13 22:17:27,551 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 2 selfloop transitions, 4 changer transitions 0/300 dead transitions. [2025-03-13 22:17:27,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 300 transitions, 1040 flow [2025-03-13 22:17:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-03-13 22:17:27,552 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9813519813519813 [2025-03-13 22:17:27,552 INFO L175 Difference]: Start difference. First operand has 360 places, 700 transitions, 4520 flow. Second operand 3 states and 842 transitions. [2025-03-13 22:17:27,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 300 transitions, 1040 flow [2025-03-13 22:17:27,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 300 transitions, 836 flow, removed 62 selfloop flow, removed 36 redundant places. [2025-03-13 22:17:27,557 INFO L231 Difference]: Finished difference. Result has 322 places, 300 transitions, 832 flow [2025-03-13 22:17:27,557 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-13 22:17:27,558 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-03-13 22:17:27,558 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 300 transitions, 832 flow [2025-03-13 22:17:27,558 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-13 22:17:27,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:27,559 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-13 22:17:27,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:17:27,559 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-13 22:17:27,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:27,562 INFO L85 PathProgramCache]: Analyzing trace with hash 115544959, now seen corresponding path program 1 times [2025-03-13 22:17:27,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:27,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505919991] [2025-03-13 22:17:27,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:27,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1127 statements into 1 equivalence classes. [2025-03-13 22:17:27,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1127 of 1127 statements. [2025-03-13 22:17:27,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:27,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-03-13 22:17:30,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505919991] [2025-03-13 22:17:30,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505919991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:30,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:30,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:30,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213161829] [2025-03-13 22:17:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:30,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:30,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:30,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:30,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:30,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 286 [2025-03-13 22:17:30,485 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-13 22:17:30,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:30,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 286 [2025-03-13 22:17:30,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:30,831 INFO L124 PetriNetUnfolderBase]: 3/1382 cut-off events. [2025-03-13 22:17:30,831 INFO L125 PetriNetUnfolderBase]: For 137/142 co-relation queries the response was YES. [2025-03-13 22:17:30,832 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-13 22:17:30,834 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 74 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-13 22:17:30,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 299 transitions, 988 flow [2025-03-13 22:17:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:30,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1304 transitions. [2025-03-13 22:17:30,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599067599067599 [2025-03-13 22:17:30,835 INFO L175 Difference]: Start difference. First operand has 322 places, 300 transitions, 832 flow. Second operand 6 states and 1304 transitions. [2025-03-13 22:17:30,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 299 transitions, 988 flow [2025-03-13 22:17:30,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 299 transitions, 981 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:17:30,840 INFO L231 Difference]: Finished difference. Result has 324 places, 299 transitions, 833 flow [2025-03-13 22:17:30,841 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-13 22:17:30,841 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 38 predicate places. [2025-03-13 22:17:30,841 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 299 transitions, 833 flow [2025-03-13 22:17:30,842 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-13 22:17:30,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:30,842 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-13 22:17:30,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:17:30,842 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-13 22:17:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash -327780419, now seen corresponding path program 1 times [2025-03-13 22:17:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:30,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193265713] [2025-03-13 22:17:30,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:30,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1138 statements into 1 equivalence classes. [2025-03-13 22:17:31,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1138 of 1138 statements. [2025-03-13 22:17:31,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:31,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-03-13 22:17:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193265713] [2025-03-13 22:17:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193265713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:33,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153106807] [2025-03-13 22:17:33,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:33,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:33,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:33,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 286 [2025-03-13 22:17:33,769 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-13 22:17:33,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:33,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 286 [2025-03-13 22:17:33,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:34,041 INFO L124 PetriNetUnfolderBase]: 5/1413 cut-off events. [2025-03-13 22:17:34,041 INFO L125 PetriNetUnfolderBase]: For 134/135 co-relation queries the response was YES. [2025-03-13 22:17:34,042 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-13 22:17:34,043 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 52 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-03-13 22:17:34,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 298 transitions, 945 flow [2025-03-13 22:17:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1419 transitions. [2025-03-13 22:17:34,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2025-03-13 22:17:34,044 INFO L175 Difference]: Start difference. First operand has 324 places, 299 transitions, 833 flow. Second operand 6 states and 1419 transitions. [2025-03-13 22:17:34,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 298 transitions, 945 flow [2025-03-13 22:17:34,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 298 transitions, 935 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:34,048 INFO L231 Difference]: Finished difference. Result has 323 places, 298 transitions, 831 flow [2025-03-13 22:17:34,048 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-13 22:17:34,048 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 37 predicate places. [2025-03-13 22:17:34,048 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 298 transitions, 831 flow [2025-03-13 22:17:34,049 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-13 22:17:34,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:34,049 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-13 22:17:34,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:17:34,049 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-13 22:17:34,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash -425106078, now seen corresponding path program 1 times [2025-03-13 22:17:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:34,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351442] [2025-03-13 22:17:34,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:34,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:34,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1148 statements into 1 equivalence classes. [2025-03-13 22:17:34,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1148 of 1148 statements. [2025-03-13 22:17:34,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:34,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-03-13 22:17:36,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351442] [2025-03-13 22:17:36,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:36,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:36,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851876569] [2025-03-13 22:17:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:36,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:36,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:36,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:36,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 286 [2025-03-13 22:17:36,879 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-13 22:17:36,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:36,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 286 [2025-03-13 22:17:36,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:37,114 INFO L124 PetriNetUnfolderBase]: 3/1376 cut-off events. [2025-03-13 22:17:37,114 INFO L125 PetriNetUnfolderBase]: For 133/134 co-relation queries the response was YES. [2025-03-13 22:17:37,115 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-13 22:17:37,117 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 54 selfloop transitions, 5 changer transitions 0/297 dead transitions. [2025-03-13 22:17:37,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 297 transitions, 947 flow [2025-03-13 22:17:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:37,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1409 transitions. [2025-03-13 22:17:37,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8210955710955711 [2025-03-13 22:17:37,118 INFO L175 Difference]: Start difference. First operand has 323 places, 298 transitions, 831 flow. Second operand 6 states and 1409 transitions. [2025-03-13 22:17:37,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 297 transitions, 947 flow [2025-03-13 22:17:37,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 297 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:37,122 INFO L231 Difference]: Finished difference. Result has 322 places, 297 transitions, 829 flow [2025-03-13 22:17:37,122 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-13 22:17:37,123 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 36 predicate places. [2025-03-13 22:17:37,123 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 297 transitions, 829 flow [2025-03-13 22:17:37,123 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-13 22:17:37,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:37,123 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-13 22:17:37,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:17:37,124 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-13 22:17:37,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:37,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1338555600, now seen corresponding path program 1 times [2025-03-13 22:17:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242605636] [2025-03-13 22:17:37,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:37,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1157 statements into 1 equivalence classes. [2025-03-13 22:17:37,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1157 of 1157 statements. [2025-03-13 22:17:37,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:37,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6835 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6835 trivial. 0 not checked. [2025-03-13 22:17:39,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:39,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242605636] [2025-03-13 22:17:39,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242605636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:39,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:39,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428264504] [2025-03-13 22:17:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:39,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:39,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:39,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:39,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 286 [2025-03-13 22:17:39,791 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-13 22:17:39,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:39,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 286 [2025-03-13 22:17:39,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:39,989 INFO L124 PetriNetUnfolderBase]: 3/1373 cut-off events. [2025-03-13 22:17:39,990 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-03-13 22:17:39,990 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-13 22:17:39,992 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 80 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2025-03-13 22:17:39,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 296 transitions, 997 flow [2025-03-13 22:17:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1279 transitions. [2025-03-13 22:17:39,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7453379953379954 [2025-03-13 22:17:39,993 INFO L175 Difference]: Start difference. First operand has 322 places, 297 transitions, 829 flow. Second operand 6 states and 1279 transitions. [2025-03-13 22:17:39,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 296 transitions, 997 flow [2025-03-13 22:17:39,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 296 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:39,996 INFO L231 Difference]: Finished difference. Result has 321 places, 296 transitions, 827 flow [2025-03-13 22:17:39,996 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-13 22:17:39,997 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 35 predicate places. [2025-03-13 22:17:39,997 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 296 transitions, 827 flow [2025-03-13 22:17:39,997 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-13 22:17:39,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:39,997 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-13 22:17:39,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-13 22:17:39,997 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-13 22:17:39,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1612038356, now seen corresponding path program 1 times [2025-03-13 22:17:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270080176] [2025-03-13 22:17:40,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:40,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1165 statements into 1 equivalence classes. [2025-03-13 22:17:40,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1165 of 1165 statements. [2025-03-13 22:17:40,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:40,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:42,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6838 trivial. 0 not checked. [2025-03-13 22:17:42,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:42,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270080176] [2025-03-13 22:17:42,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270080176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:42,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:42,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:42,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533738685] [2025-03-13 22:17:42,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:42,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:42,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:42,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:42,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:43,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 286 [2025-03-13 22:17:43,039 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-13 22:17:43,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:43,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 286 [2025-03-13 22:17:43,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:43,254 INFO L124 PetriNetUnfolderBase]: 3/1370 cut-off events. [2025-03-13 22:17:43,254 INFO L125 PetriNetUnfolderBase]: For 135/140 co-relation queries the response was YES. [2025-03-13 22:17:43,255 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-13 22:17:43,256 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 0 selfloop transitions, 0 changer transitions 295/295 dead transitions. [2025-03-13 22:17:43,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 295 transitions, 993 flow [2025-03-13 22:17:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2025-03-13 22:17:43,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7482517482517482 [2025-03-13 22:17:43,257 INFO L175 Difference]: Start difference. First operand has 321 places, 296 transitions, 827 flow. Second operand 6 states and 1284 transitions. [2025-03-13 22:17:43,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 295 transitions, 993 flow [2025-03-13 22:17:43,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 295 transitions, 983 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:43,260 INFO L231 Difference]: Finished difference. Result has 320 places, 0 transitions, 0 flow [2025-03-13 22:17:43,260 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-13 22:17:43,260 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, 34 predicate places. [2025-03-13 22:17:43,260 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 0 transitions, 0 flow [2025-03-13 22:17:43,261 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-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (24 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2025-03-13 22:17:43,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2025-03-13 22:17:43,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2025-03-13 22:17:43,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-13 22:17:43,265 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-13 22:17:43,268 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:17:43,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:17:43,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:17:43 BasicIcfg [2025-03-13 22:17:43,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:17:43,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:17:43,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:17:43,273 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:17:43,273 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:02" (3/4) ... [2025-03-13 22:17:43,274 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:17:43,276 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-13 22:17:43,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-13 22:17:43,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:17:43,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-13 22:17:43,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:17:43,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:17:43,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:17:43,344 INFO L158 Benchmark]: Toolchain (without parser) took 41773.66ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 120.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-03-13 22:17:43,345 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:17:43,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.72ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 81.6MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-13 22:17:43,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.18ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 77.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:17:43,346 INFO L158 Benchmark]: Boogie Preprocessor took 41.89ms. Allocated memory is still 167.8MB. Free memory was 77.4MB in the beginning and 74.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:17:43,347 INFO L158 Benchmark]: IcfgBuilder took 648.34ms. Allocated memory is still 167.8MB. Free memory was 74.6MB in the beginning and 39.7MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-13 22:17:43,347 INFO L158 Benchmark]: TraceAbstraction took 40508.18ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 38.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-13 22:17:43,347 INFO L158 Benchmark]: Witness Printer took 70.65ms. Allocated memory is still 2.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:17:43,348 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.25ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.72ms. Allocated memory is still 167.8MB. Free memory was 120.4MB in the beginning and 81.6MB in the end (delta: 38.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.18ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 77.4MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.89ms. Allocated memory is still 167.8MB. Free memory was 77.4MB in the beginning and 74.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 648.34ms. Allocated memory is still 167.8MB. Free memory was 74.6MB in the beginning and 39.7MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40508.18ms. Allocated memory was 167.8MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 38.9MB in the beginning and 1.3GB in the end (delta: -1.3GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 70.65ms. Allocated memory is still 2.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 4.6MB). There was no memory consumed. 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, 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: 40.4s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4836 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3108 mSDsluCounter, 463 SdHoareTripleChecker+Invalid, 5.4s 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.2s SatisfiabilityAnalysisTime, 22.4s InterpolantComputationTime, 13636 NumberOfCodeBlocks, 11536 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 14942 ConstructedInterpolants, 0 QuantifiedInterpolants, 23474 SizeOfPredicates, 22 NumberOfNonLiveVariables, 5137 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 59041/69658 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-13 22:17:43,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE