./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:50:39,428 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:50:39,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:50:39,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:50:39,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:50:39,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:50:39,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:50:39,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:50:39,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:50:39,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:50:39,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:50:39,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:50:39,517 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:50:39,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:50:39,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:50:39,517 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:50:39,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:50:39,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:50:39,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:50:39,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:50:39,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:50:39,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:50:39,518 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:50:39,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:50:39,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:39,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:50:39,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:50:39,521 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-03-04 06:50:39,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:50:39,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:50:39,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:50:39,777 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:50:39,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:50:39,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-04 06:50:40,923 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1131a4056/6504a5020db14a9c966549e49ae7b5f6/FLAG4354341ac [2025-03-04 06:50:41,258 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:50:41,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-04 06:50:41,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1131a4056/6504a5020db14a9c966549e49ae7b5f6/FLAG4354341ac [2025-03-04 06:50:41,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1131a4056/6504a5020db14a9c966549e49ae7b5f6 [2025-03-04 06:50:41,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:50:41,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:50:41,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:41,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:50:41,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:50:41,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c951563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41, skipping insertion in model container [2025-03-04 06:50:41,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:50:41,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:41,824 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:50:41,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:50:41,907 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:50:41,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41 WrapperNode [2025-03-04 06:50:41,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:50:41,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:41,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:50:41,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:50:41,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,955 INFO L138 Inliner]: procedures = 272, calls = 108, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 412 [2025-03-04 06:50:41,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:50:41,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:50:41,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:50:41,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:50:41,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,971 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,990 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:41,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:50:41,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:50:41,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:50:41,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:50:42,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (1/1) ... [2025-03-04 06:50:42,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:50:42,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:42,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:50:42,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:50:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:50:42,055 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:50:42,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:50:42,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:50:42,056 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:50:42,171 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:50:42,173 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:50:42,563 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 06:50:42,564 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 06:50:42,644 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:50:42,644 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:50:42,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:50:42,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:50:42,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:42 BoogieIcfgContainer [2025-03-04 06:50:42,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:50:42,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:50:42,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:50:42,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:50:42,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:50:41" (1/3) ... [2025-03-04 06:50:42,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10754125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:42, skipping insertion in model container [2025-03-04 06:50:42,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:50:41" (2/3) ... [2025-03-04 06:50:42,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10754125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:50:42, skipping insertion in model container [2025-03-04 06:50:42,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:50:42" (3/3) ... [2025-03-04 06:50:42,687 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-03-04 06:50:42,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:50:42,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 394 locations, 1 initial locations, 17 loop locations, and 17 error locations. [2025-03-04 06:50:42,700 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:50:42,774 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:50:42,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 437 transitions, 881 flow [2025-03-04 06:50:42,997 INFO L124 PetriNetUnfolderBase]: 70/666 cut-off events. [2025-03-04 06:50:43,000 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:50:43,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 666 events. 70/666 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3325 event pairs, 0 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 343. Up to 8 conditions per place. [2025-03-04 06:50:43,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 437 transitions, 881 flow [2025-03-04 06:50:43,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 397 places, 437 transitions, 881 flow [2025-03-04 06:50:43,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:43,032 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;@aa5b6a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:43,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 06:50:43,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:43,054 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-04 06:50:43,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:43,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:43,056 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] [2025-03-04 06:50:43,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:43,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:43,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1255724097, now seen corresponding path program 1 times [2025-03-04 06:50:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:43,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539474731] [2025-03-04 06:50:43,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:43,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:43,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:50:43,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:50:43,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:43,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:43,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:43,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539474731] [2025-03-04 06:50:43,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539474731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:43,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:43,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083769785] [2025-03-04 06:50:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:43,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:43,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:43,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:43,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 437 [2025-03-04 06:50:43,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 437 transitions, 881 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:43,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:43,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 437 [2025-03-04 06:50:43,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:43,810 INFO L124 PetriNetUnfolderBase]: 161/2146 cut-off events. [2025-03-04 06:50:43,810 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-04 06:50:43,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 2146 events. 161/2146 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17550 event pairs, 120 based on Foata normal form. 285/2245 useless extension candidates. Maximal degree in co-relation 2124. Up to 302 conditions per place. [2025-03-04 06:50:43,826 INFO L140 encePairwiseOnDemand]: 398/437 looper letters, 29 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2025-03-04 06:50:43,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 396 transitions, 861 flow [2025-03-04 06:50:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1172 transitions. [2025-03-04 06:50:43,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8939740655987796 [2025-03-04 06:50:43,848 INFO L175 Difference]: Start difference. First operand has 397 places, 437 transitions, 881 flow. Second operand 3 states and 1172 transitions. [2025-03-04 06:50:43,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 396 transitions, 861 flow [2025-03-04 06:50:43,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 396 transitions, 861 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:43,867 INFO L231 Difference]: Finished difference. Result has 394 places, 396 transitions, 809 flow [2025-03-04 06:50:43,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=809, PETRI_PLACES=394, PETRI_TRANSITIONS=396} [2025-03-04 06:50:43,872 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, -3 predicate places. [2025-03-04 06:50:43,873 INFO L471 AbstractCegarLoop]: Abstraction has has 394 places, 396 transitions, 809 flow [2025-03-04 06:50:43,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:43,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:43,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:43,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:50:43,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:43,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1696817222, now seen corresponding path program 1 times [2025-03-04 06:50:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589219842] [2025-03-04 06:50:43,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:43,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:43,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:43,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:43,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:43,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:44,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589219842] [2025-03-04 06:50:44,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589219842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:44,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748194997] [2025-03-04 06:50:44,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:44,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:44,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:44,113 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-04 06:50:44,115 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-04 06:50:44,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:44,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:44,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:50:44,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:44,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:44,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748194997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:44,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:50:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506718833] [2025-03-04 06:50:44,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:44,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:50:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:44,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:50:44,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:50:44,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 437 [2025-03-04 06:50:44,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 394 places, 396 transitions, 809 flow. Second operand has 10 states, 10 states have (on average 366.8) internal successors, (3668), 10 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:44,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:44,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 437 [2025-03-04 06:50:44,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:44,765 INFO L124 PetriNetUnfolderBase]: 161/2153 cut-off events. [2025-03-04 06:50:44,766 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:50:44,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 2153 events. 161/2153 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17372 event pairs, 120 based on Foata normal form. 2/1969 useless extension candidates. Maximal degree in co-relation 2386. Up to 302 conditions per place. [2025-03-04 06:50:44,781 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 33 selfloop transitions, 9 changer transitions 0/404 dead transitions. [2025-03-04 06:50:44,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 404 transitions, 911 flow [2025-03-04 06:50:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:50:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:50:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3329 transitions. [2025-03-04 06:50:44,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8464276633613018 [2025-03-04 06:50:44,788 INFO L175 Difference]: Start difference. First operand has 394 places, 396 transitions, 809 flow. Second operand 9 states and 3329 transitions. [2025-03-04 06:50:44,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 404 transitions, 911 flow [2025-03-04 06:50:44,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 401 places, 404 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:44,795 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 857 flow [2025-03-04 06:50:44,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=857, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2025-03-04 06:50:44,796 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 7 predicate places. [2025-03-04 06:50:44,796 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 857 flow [2025-03-04 06:50:44,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 366.8) internal successors, (3668), 10 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:44,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:44,799 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:44,806 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-04 06:50:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:45,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:45,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1478203686, now seen corresponding path program 2 times [2025-03-04 06:50:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:45,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425818476] [2025-03-04 06:50:45,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:45,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:45,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-04 06:50:45,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-04 06:50:45,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:50:45,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425818476] [2025-03-04 06:50:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425818476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:45,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:45,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:45,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584219106] [2025-03-04 06:50:45,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:45,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:45,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:45,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:45,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 437 [2025-03-04 06:50:45,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:45,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:45,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 437 [2025-03-04 06:50:45,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:46,900 INFO L124 PetriNetUnfolderBase]: 2280/9205 cut-off events. [2025-03-04 06:50:46,900 INFO L125 PetriNetUnfolderBase]: For 11/14 co-relation queries the response was YES. [2025-03-04 06:50:46,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13691 conditions, 9205 events. 2280/9205 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 94452 event pairs, 1764 based on Foata normal form. 0/8367 useless extension candidates. Maximal degree in co-relation 13567. Up to 4224 conditions per place. [2025-03-04 06:50:46,939 INFO L140 encePairwiseOnDemand]: 410/437 looper letters, 133 selfloop transitions, 86 changer transitions 0/519 dead transitions. [2025-03-04 06:50:46,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 519 transitions, 1529 flow [2025-03-04 06:50:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:50:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:50:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1996 transitions. [2025-03-04 06:50:46,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7612509534706331 [2025-03-04 06:50:46,943 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 857 flow. Second operand 6 states and 1996 transitions. [2025-03-04 06:50:46,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 519 transitions, 1529 flow [2025-03-04 06:50:46,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 519 transitions, 1523 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:46,955 INFO L231 Difference]: Finished difference. Result has 413 places, 487 transitions, 1417 flow [2025-03-04 06:50:46,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1417, PETRI_PLACES=413, PETRI_TRANSITIONS=487} [2025-03-04 06:50:46,957 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 16 predicate places. [2025-03-04 06:50:46,957 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 487 transitions, 1417 flow [2025-03-04 06:50:46,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 297.5) internal successors, (1785), 6 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:46,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:46,958 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:46,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:50:46,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:46,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1059436389, now seen corresponding path program 1 times [2025-03-04 06:50:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098157606] [2025-03-04 06:50:46,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:46,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:50:46,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:50:46,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:46,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:47,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:47,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098157606] [2025-03-04 06:50:47,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098157606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:47,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:47,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:47,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799245279] [2025-03-04 06:50:47,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:47,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:47,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:47,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:47,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:47,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 437 [2025-03-04 06:50:47,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 487 transitions, 1417 flow. Second operand has 3 states, 3 states have (on average 369.6666666666667) internal successors, (1109), 3 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:47,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:47,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 437 [2025-03-04 06:50:47,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:47,413 INFO L124 PetriNetUnfolderBase]: 375/2998 cut-off events. [2025-03-04 06:50:47,413 INFO L125 PetriNetUnfolderBase]: For 158/180 co-relation queries the response was YES. [2025-03-04 06:50:47,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 2998 events. 375/2998 cut-off events. For 158/180 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 26524 event pairs, 136 based on Foata normal form. 1/2751 useless extension candidates. Maximal degree in co-relation 3948. Up to 374 conditions per place. [2025-03-04 06:50:47,432 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 36 selfloop transitions, 3 changer transitions 0/495 dead transitions. [2025-03-04 06:50:47,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 495 transitions, 1511 flow [2025-03-04 06:50:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-03-04 06:50:47,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8718535469107551 [2025-03-04 06:50:47,435 INFO L175 Difference]: Start difference. First operand has 413 places, 487 transitions, 1417 flow. Second operand 3 states and 1143 transitions. [2025-03-04 06:50:47,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 495 transitions, 1511 flow [2025-03-04 06:50:47,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 495 transitions, 1511 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:47,447 INFO L231 Difference]: Finished difference. Result has 416 places, 487 transitions, 1428 flow [2025-03-04 06:50:47,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=1417, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=484, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1428, PETRI_PLACES=416, PETRI_TRANSITIONS=487} [2025-03-04 06:50:47,449 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 19 predicate places. [2025-03-04 06:50:47,449 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 487 transitions, 1428 flow [2025-03-04 06:50:47,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.6666666666667) internal successors, (1109), 3 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:47,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:47,451 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:47,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:50:47,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:47,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1283528591, now seen corresponding path program 1 times [2025-03-04 06:50:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:47,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87292782] [2025-03-04 06:50:47,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:47,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:50:47,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:50:47,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:47,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:47,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:47,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87292782] [2025-03-04 06:50:47,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87292782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:47,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466495727] [2025-03-04 06:50:47,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:47,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:47,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:47,631 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-04 06:50:47,633 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-04 06:50:47,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 06:50:47,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 06:50:47,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:47,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:47,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:50:47,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:47,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466495727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:47,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:50:47,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048179341] [2025-03-04 06:50:47,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:47,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:50:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:47,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:50:47,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:50:47,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 437 [2025-03-04 06:50:47,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 487 transitions, 1428 flow. Second operand has 18 states, 18 states have (on average 366.94444444444446) internal successors, (6605), 18 states have internal predecessors, (6605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:47,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:47,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 437 [2025-03-04 06:50:47,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:48,504 INFO L124 PetriNetUnfolderBase]: 361/2918 cut-off events. [2025-03-04 06:50:48,505 INFO L125 PetriNetUnfolderBase]: For 156/183 co-relation queries the response was YES. [2025-03-04 06:50:48,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 2918 events. 361/2918 cut-off events. For 156/183 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 25557 event pairs, 120 based on Foata normal form. 4/2697 useless extension candidates. Maximal degree in co-relation 4142. Up to 556 conditions per place. [2025-03-04 06:50:48,519 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 37 selfloop transitions, 21 changer transitions 0/505 dead transitions. [2025-03-04 06:50:48,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 505 transitions, 1632 flow [2025-03-04 06:50:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:50:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:50:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7727 transitions. [2025-03-04 06:50:48,530 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.84199629508554 [2025-03-04 06:50:48,531 INFO L175 Difference]: Start difference. First operand has 416 places, 487 transitions, 1428 flow. Second operand 21 states and 7727 transitions. [2025-03-04 06:50:48,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 505 transitions, 1632 flow [2025-03-04 06:50:48,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 505 transitions, 1626 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:50:48,540 INFO L231 Difference]: Finished difference. Result has 439 places, 500 transitions, 1552 flow [2025-03-04 06:50:48,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1552, PETRI_PLACES=439, PETRI_TRANSITIONS=500} [2025-03-04 06:50:48,543 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 42 predicate places. [2025-03-04 06:50:48,543 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 500 transitions, 1552 flow [2025-03-04 06:50:48,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 366.94444444444446) internal successors, (6605), 18 states have internal predecessors, (6605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:48,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:48,547 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:48,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:50:48,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:48,751 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1517517135, now seen corresponding path program 2 times [2025-03-04 06:50:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:48,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462508300] [2025-03-04 06:50:48,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:48,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 06:50:48,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:50:48,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:50:48,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:49,091 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:49,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462508300] [2025-03-04 06:50:49,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462508300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:49,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209958481] [2025-03-04 06:50:49,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:49,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:49,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:49,093 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-04 06:50:49,095 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-04 06:50:49,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-04 06:50:49,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:50:49,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:50:49,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:49,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:50:49,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:49,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209958481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:49,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:49,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:50:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124483752] [2025-03-04 06:50:49,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:49,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:50:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:49,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:50:49,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:50:49,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 437 [2025-03-04 06:50:49,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 500 transitions, 1552 flow. Second operand has 23 states, 23 states have (on average 367.04347826086956) internal successors, (8442), 23 states have internal predecessors, (8442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:49,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:49,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 437 [2025-03-04 06:50:49,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:50,147 INFO L124 PetriNetUnfolderBase]: 361/2933 cut-off events. [2025-03-04 06:50:50,147 INFO L125 PetriNetUnfolderBase]: For 257/284 co-relation queries the response was YES. [2025-03-04 06:50:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 2933 events. 361/2933 cut-off events. For 257/284 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 25584 event pairs, 120 based on Foata normal form. 3/2711 useless extension candidates. Maximal degree in co-relation 4142. Up to 556 conditions per place. [2025-03-04 06:50:50,167 INFO L140 encePairwiseOnDemand]: 431/437 looper letters, 40 selfloop transitions, 30 changer transitions 0/517 dead transitions. [2025-03-04 06:50:50,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 517 transitions, 1820 flow [2025-03-04 06:50:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:50:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:50:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11023 transitions. [2025-03-04 06:50:50,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8408085430968726 [2025-03-04 06:50:50,183 INFO L175 Difference]: Start difference. First operand has 439 places, 500 transitions, 1552 flow. Second operand 30 states and 11023 transitions. [2025-03-04 06:50:50,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 517 transitions, 1820 flow [2025-03-04 06:50:50,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 517 transitions, 1790 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-04 06:50:50,196 INFO L231 Difference]: Finished difference. Result has 466 places, 510 transitions, 1680 flow [2025-03-04 06:50:50,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=437, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1680, PETRI_PLACES=466, PETRI_TRANSITIONS=510} [2025-03-04 06:50:50,199 INFO L279 CegarLoopForPetriNet]: 397 programPoint places, 69 predicate places. [2025-03-04 06:50:50,199 INFO L471 AbstractCegarLoop]: Abstraction has has 466 places, 510 transitions, 1680 flow [2025-03-04 06:50:50,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 367.04347826086956) internal successors, (8442), 23 states have internal predecessors, (8442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:50,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:50,203 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:50,210 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-04 06:50:50,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:50,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-04 06:50:50,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:50,409 INFO L85 PathProgramCache]: Analyzing trace with hash 210233430, now seen corresponding path program 3 times [2025-03-04 06:50:50,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:50,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568536400] [2025-03-04 06:50:50,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:50:50,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:50,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-03-04 06:50:50,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:50:50,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 06:50:50,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:50,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 06:50:50,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-04 06:50:50,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 06:50:50,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:50,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 06:50:50,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 06:50:50,555 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 06:50:50,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-04 06:50:50,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-04 06:50:50,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-04 06:50:50,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-04 06:50:50,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-04 06:50:50,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-04 06:50:50,562 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-04 06:50:50,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-04 06:50:50,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:50:50,563 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-04 06:50:50,567 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 06:50:50,567 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 06:50:50,639 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:50:50,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 497 places, 550 transitions, 1116 flow [2025-03-04 06:50:50,759 INFO L124 PetriNetUnfolderBase]: 113/1035 cut-off events. [2025-03-04 06:50:50,760 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:50:50,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 1035 events. 113/1035 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6065 event pairs, 0 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 668. Up to 12 conditions per place. [2025-03-04 06:50:50,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 497 places, 550 transitions, 1116 flow [2025-03-04 06:50:50,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 497 places, 550 transitions, 1116 flow [2025-03-04 06:50:50,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:50:50,781 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;@aa5b6a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:50:50,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 06:50:50,791 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:50:50,791 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-04 06:50:50,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:50:50,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:50,791 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] [2025-03-04 06:50:50,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:50,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:50,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2131633177, now seen corresponding path program 1 times [2025-03-04 06:50:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106149285] [2025-03-04 06:50:50,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:50,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:50:50,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:50:50,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:50,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:50,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106149285] [2025-03-04 06:50:50,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106149285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:50,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:50,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:50:50,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522556892] [2025-03-04 06:50:50,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:50,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:50:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:50,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:50:50,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:50:50,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 458 out of 550 [2025-03-04 06:50:50,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 550 transitions, 1116 flow. Second operand has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:50,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:50,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 458 of 550 [2025-03-04 06:50:50,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:53,167 INFO L124 PetriNetUnfolderBase]: 2887/20258 cut-off events. [2025-03-04 06:50:53,167 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-03-04 06:50:53,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24514 conditions, 20258 events. 2887/20258 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 271352 event pairs, 2376 based on Foata normal form. 3869/22410 useless extension candidates. Maximal degree in co-relation 21856. Up to 4183 conditions per place. [2025-03-04 06:50:53,407 INFO L140 encePairwiseOnDemand]: 499/550 looper letters, 39 selfloop transitions, 2 changer transitions 0/495 dead transitions. [2025-03-04 06:50:53,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 495 transitions, 1088 flow [2025-03-04 06:50:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:50:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:50:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1464 transitions. [2025-03-04 06:50:53,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872727272727273 [2025-03-04 06:50:53,411 INFO L175 Difference]: Start difference. First operand has 497 places, 550 transitions, 1116 flow. Second operand 3 states and 1464 transitions. [2025-03-04 06:50:53,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 495 transitions, 1088 flow [2025-03-04 06:50:53,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 495 transitions, 1088 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:50:53,418 INFO L231 Difference]: Finished difference. Result has 492 places, 495 transitions, 1016 flow [2025-03-04 06:50:53,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=550, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1016, PETRI_PLACES=492, PETRI_TRANSITIONS=495} [2025-03-04 06:50:53,420 INFO L279 CegarLoopForPetriNet]: 497 programPoint places, -5 predicate places. [2025-03-04 06:50:53,420 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 495 transitions, 1016 flow [2025-03-04 06:50:53,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 459.3333333333333) internal successors, (1378), 3 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:53,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:53,421 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] [2025-03-04 06:50:53,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:50:53,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:53,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1126435078, now seen corresponding path program 1 times [2025-03-04 06:50:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:53,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607423486] [2025-03-04 06:50:53,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:53,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:53,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:53,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:53,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607423486] [2025-03-04 06:50:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607423486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:50:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072506938] [2025-03-04 06:50:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:50:53,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:53,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:50:53,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:50:53,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:50:53,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 06:50:53,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 06:50:53,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:50:53,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:53,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:50:53,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:50:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:53,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:50:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:50:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072506938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:50:53,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:50:53,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:50:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145192444] [2025-03-04 06:50:53,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:50:53,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:50:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:53,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:50:53,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:50:53,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 550 [2025-03-04 06:50:53,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 495 transitions, 1016 flow. Second operand has 10 states, 10 states have (on average 456.8) internal successors, (4568), 10 states have internal predecessors, (4568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:53,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:53,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 550 [2025-03-04 06:50:53,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:50:56,208 INFO L124 PetriNetUnfolderBase]: 2887/20265 cut-off events. [2025-03-04 06:50:56,209 INFO L125 PetriNetUnfolderBase]: For 152/156 co-relation queries the response was YES. [2025-03-04 06:50:56,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24540 conditions, 20265 events. 2887/20265 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 271522 event pairs, 2376 based on Foata normal form. 2/18550 useless extension candidates. Maximal degree in co-relation 24444. Up to 4183 conditions per place. [2025-03-04 06:50:56,390 INFO L140 encePairwiseOnDemand]: 544/550 looper letters, 43 selfloop transitions, 9 changer transitions 0/503 dead transitions. [2025-03-04 06:50:56,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 503 transitions, 1138 flow [2025-03-04 06:50:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:50:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:50:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4149 transitions. [2025-03-04 06:50:56,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8381818181818181 [2025-03-04 06:50:56,398 INFO L175 Difference]: Start difference. First operand has 492 places, 495 transitions, 1016 flow. Second operand 9 states and 4149 transitions. [2025-03-04 06:50:56,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 503 transitions, 1138 flow [2025-03-04 06:50:56,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 503 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:50:56,406 INFO L231 Difference]: Finished difference. Result has 502 places, 501 transitions, 1064 flow [2025-03-04 06:50:56,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=550, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1064, PETRI_PLACES=502, PETRI_TRANSITIONS=501} [2025-03-04 06:50:56,408 INFO L279 CegarLoopForPetriNet]: 497 programPoint places, 5 predicate places. [2025-03-04 06:50:56,408 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 501 transitions, 1064 flow [2025-03-04 06:50:56,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 456.8) internal successors, (4568), 10 states have internal predecessors, (4568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:56,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:50:56,409 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:50:56,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:50:56,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:50:56,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-03-04 06:50:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:50:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1979435430, now seen corresponding path program 2 times [2025-03-04 06:50:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:50:56,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974296914] [2025-03-04 06:50:56,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:50:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:50:56,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-04 06:50:56,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-04 06:50:56,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:50:56,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:50:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 06:50:56,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:50:56,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974296914] [2025-03-04 06:50:56,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974296914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:50:56,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:50:56,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:50:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249665185] [2025-03-04 06:50:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:50:56,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:50:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:50:56,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:50:56,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:50:57,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 550 [2025-03-04 06:50:57,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 501 transitions, 1064 flow. Second operand has 6 states, 6 states have (on average 367.5) internal successors, (2205), 6 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:50:57,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:50:57,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 550 [2025-03-04 06:50:57,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand