./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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_72-funloop_hard_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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:40:41,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:40:41,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:40:41,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:40:41,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:40:41,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:40:41,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:40:41,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:40:41,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:40:41,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:40:41,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:40:41,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:40:41,809 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:40:41,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:40:41,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:40:41,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:40:41,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:40:41,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:40:41,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:40:41,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:40:41,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:40:41,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:40:41,812 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:40:41,812 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:40:41,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:40:41,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:40:41,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:40:41,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:40:41,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:40:41,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:40:41,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:40:41,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:40:41,814 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-03-14 01:40:42,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:40:42,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:40:42,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:40:42,056 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:40:42,056 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:40:42,057 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-14 01:40:43,279 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0594b63/eee62e510d644bd39cd27413643598ad/FLAGd0a26ce46 [2025-03-14 01:40:43,573 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:40:43,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-14 01:40:43,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0594b63/eee62e510d644bd39cd27413643598ad/FLAGd0a26ce46 [2025-03-14 01:40:43,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b0594b63/eee62e510d644bd39cd27413643598ad [2025-03-14 01:40:43,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:40:43,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:40:43,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:40:43,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:40:43,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:40:43,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:40:43" (1/1) ... [2025-03-14 01:40:43,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac4823c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:43, skipping insertion in model container [2025-03-14 01:40:43,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:40:43" (1/1) ... [2025-03-14 01:40:43,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:40:44,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:40:44,202 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:40:44,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:40:44,290 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:40:44,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44 WrapperNode [2025-03-14 01:40:44,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:40:44,292 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:40:44,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:40:44,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:40:44,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,356 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 418 [2025-03-14 01:40:44,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:40:44,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:40:44,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:40:44,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:40:44,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,400 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:40:44,409 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:40:44,409 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:40:44,409 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:40:44,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (1/1) ... [2025-03-14 01:40:44,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:40:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:44,443 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-14 01:40:44,451 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-14 01:40:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:40:44,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:40:44,466 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:40:44,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:40:44,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:40:44,467 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:40:44,573 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:40:44,575 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:40:44,990 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-14 01:40:44,990 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-14 01:40:45,099 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:40:45,101 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:40:45,101 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:40:45,155 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:40:45,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:40:45 BoogieIcfgContainer [2025-03-14 01:40:45,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:40:45,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:40:45,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:40:45,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:40:45,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:40:43" (1/3) ... [2025-03-14 01:40:45,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e51725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:40:45, skipping insertion in model container [2025-03-14 01:40:45,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:44" (2/3) ... [2025-03-14 01:40:45,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e51725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:40:45, skipping insertion in model container [2025-03-14 01:40:45,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:40:45" (3/3) ... [2025-03-14 01:40:45,169 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-03-14 01:40:45,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:40:45,186 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 398 locations, 1 initial locations, 17 loop locations, and 17 error locations. [2025-03-14 01:40:45,186 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:40:45,264 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:40:45,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 401 places, 441 transitions, 889 flow [2025-03-14 01:40:45,476 INFO L124 PetriNetUnfolderBase]: 70/674 cut-off events. [2025-03-14 01:40:45,481 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:40:45,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 674 events. 70/674 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3387 event pairs, 0 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 347. Up to 8 conditions per place. [2025-03-14 01:40:45,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 401 places, 441 transitions, 889 flow [2025-03-14 01:40:45,496 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 401 places, 441 transitions, 889 flow [2025-03-14 01:40:45,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:40:45,514 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;@3214e572, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:40:45,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-14 01:40:45,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:40:45,531 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-14 01:40:45,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:40:45,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:45,532 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-14 01:40:45,532 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-14 01:40:45,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 955900180, now seen corresponding path program 1 times [2025-03-14 01:40:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941412748] [2025-03-14 01:40:45,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:45,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:40:45,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:40:45,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:45,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:45,879 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-14 01:40:45,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:45,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941412748] [2025-03-14 01:40:45,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941412748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:45,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:45,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:40:45,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144358393] [2025-03-14 01:40:45,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:45,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:45,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:45,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:45,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 441 [2025-03-14 01:40:45,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 441 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:45,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:45,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 441 [2025-03-14 01:40:45,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:46,379 INFO L124 PetriNetUnfolderBase]: 181/2360 cut-off events. [2025-03-14 01:40:46,379 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-14 01:40:46,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2707 conditions, 2360 events. 181/2360 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19627 event pairs, 136 based on Foata normal form. 301/2459 useless extension candidates. Maximal degree in co-relation 2370. Up to 340 conditions per place. [2025-03-14 01:40:46,396 INFO L140 encePairwiseOnDemand]: 402/441 looper letters, 31 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-03-14 01:40:46,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 400 transitions, 873 flow [2025-03-14 01:40:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1180 transitions. [2025-03-14 01:40:46,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.891912320483749 [2025-03-14 01:40:46,414 INFO L175 Difference]: Start difference. First operand has 401 places, 441 transitions, 889 flow. Second operand 3 states and 1180 transitions. [2025-03-14 01:40:46,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 400 transitions, 873 flow [2025-03-14 01:40:46,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 400 transitions, 873 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:40:46,425 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 817 flow [2025-03-14 01:40:46,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=817, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2025-03-14 01:40:46,432 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, -3 predicate places. [2025-03-14 01:40:46,432 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 817 flow [2025-03-14 01:40:46,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:46,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:46,433 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-14 01:40:46,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:40:46,434 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-14 01:40:46,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1239613547, now seen corresponding path program 1 times [2025-03-14 01:40:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:46,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273412233] [2025-03-14 01:40:46,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:46,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:46,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:46,629 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-14 01:40:46,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:46,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273412233] [2025-03-14 01:40:46,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273412233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:46,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563218903] [2025-03-14 01:40:46,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:46,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:46,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:46,632 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-14 01:40:46,632 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-14 01:40:46,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:46,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:46,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:46,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:46,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:40:46,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:46,772 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-14 01:40:46,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:46,807 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-14 01:40:46,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563218903] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:46,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:46,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:40:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539494077] [2025-03-14 01:40:46,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:46,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:40:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:46,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:40:46,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:40:46,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 441 [2025-03-14 01:40:46,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 817 flow. Second operand has 10 states, 10 states have (on average 368.8) internal successors, (3688), 10 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:46,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:46,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 441 [2025-03-14 01:40:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:47,287 INFO L124 PetriNetUnfolderBase]: 181/2367 cut-off events. [2025-03-14 01:40:47,288 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-03-14 01:40:47,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 2367 events. 181/2367 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19663 event pairs, 136 based on Foata normal form. 2/2167 useless extension candidates. Maximal degree in co-relation 2638. Up to 340 conditions per place. [2025-03-14 01:40:47,304 INFO L140 encePairwiseOnDemand]: 435/441 looper letters, 35 selfloop transitions, 9 changer transitions 0/408 dead transitions. [2025-03-14 01:40:47,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 408 transitions, 923 flow [2025-03-14 01:40:47,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:40:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:40:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3349 transitions. [2025-03-14 01:40:47,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437893675988914 [2025-03-14 01:40:47,314 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 817 flow. Second operand 9 states and 3349 transitions. [2025-03-14 01:40:47,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 408 transitions, 923 flow [2025-03-14 01:40:47,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 408 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:40:47,321 INFO L231 Difference]: Finished difference. Result has 408 places, 406 transitions, 865 flow [2025-03-14 01:40:47,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=865, PETRI_PLACES=408, PETRI_TRANSITIONS=406} [2025-03-14 01:40:47,322 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 7 predicate places. [2025-03-14 01:40:47,322 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 406 transitions, 865 flow [2025-03-14 01:40:47,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 368.8) internal successors, (3688), 10 states have internal predecessors, (3688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:47,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:47,324 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-14 01:40:47,331 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-14 01:40:47,525 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-14 01:40:47,525 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-14 01:40:47,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2047771915, now seen corresponding path program 2 times [2025-03-14 01:40:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734960502] [2025-03-14 01:40:47,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:47,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-14 01:40:47,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-14 01:40:47,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:40:47,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:47,952 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-14 01:40:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734960502] [2025-03-14 01:40:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734960502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:47,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:40:47,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499440238] [2025-03-14 01:40:47,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:47,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:40:47,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:47,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:40:47,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:40:48,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 441 [2025-03-14 01:40:48,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 406 transitions, 865 flow. Second operand has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:48,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:48,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 441 [2025-03-14 01:40:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:49,560 INFO L124 PetriNetUnfolderBase]: 2317/9331 cut-off events. [2025-03-14 01:40:49,560 INFO L125 PetriNetUnfolderBase]: For 11/14 co-relation queries the response was YES. [2025-03-14 01:40:49,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13912 conditions, 9331 events. 2317/9331 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 96079 event pairs, 1820 based on Foata normal form. 0/8489 useless extension candidates. Maximal degree in co-relation 13788. Up to 4319 conditions per place. [2025-03-14 01:40:49,595 INFO L140 encePairwiseOnDemand]: 414/441 looper letters, 135 selfloop transitions, 86 changer transitions 0/523 dead transitions. [2025-03-14 01:40:49,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 523 transitions, 1541 flow [2025-03-14 01:40:49,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:40:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:40:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2010 transitions. [2025-03-14 01:40:49,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7596371882086168 [2025-03-14 01:40:49,600 INFO L175 Difference]: Start difference. First operand has 408 places, 406 transitions, 865 flow. Second operand 6 states and 2010 transitions. [2025-03-14 01:40:49,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 523 transitions, 1541 flow [2025-03-14 01:40:49,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 523 transitions, 1535 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:40:49,611 INFO L231 Difference]: Finished difference. Result has 417 places, 491 transitions, 1425 flow [2025-03-14 01:40:49,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1425, PETRI_PLACES=417, PETRI_TRANSITIONS=491} [2025-03-14 01:40:49,613 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 16 predicate places. [2025-03-14 01:40:49,613 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 491 transitions, 1425 flow [2025-03-14 01:40:49,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.5) internal successors, (1797), 6 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:49,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:49,615 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, 1, 1] [2025-03-14 01:40:49,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:40:49,615 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-14 01:40:49,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1837394325, now seen corresponding path program 1 times [2025-03-14 01:40:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779807036] [2025-03-14 01:40:49,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:49,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:40:49,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:40:49,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:49,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:49,703 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-14 01:40:49,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:49,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779807036] [2025-03-14 01:40:49,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779807036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:49,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:49,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:40:49,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429264243] [2025-03-14 01:40:49,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:49,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:49,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:49,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:49,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:49,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 441 [2025-03-14 01:40:49,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 491 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:49,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:49,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 441 [2025-03-14 01:40:49,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:50,084 INFO L124 PetriNetUnfolderBase]: 403/3090 cut-off events. [2025-03-14 01:40:50,085 INFO L125 PetriNetUnfolderBase]: For 156/170 co-relation queries the response was YES. [2025-03-14 01:40:50,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4242 conditions, 3090 events. 403/3090 cut-off events. For 156/170 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 27371 event pairs, 95 based on Foata normal form. 1/2838 useless extension candidates. Maximal degree in co-relation 4116. Up to 410 conditions per place. [2025-03-14 01:40:50,099 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 38 selfloop transitions, 3 changer transitions 0/499 dead transitions. [2025-03-14 01:40:50,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 499 transitions, 1523 flow [2025-03-14 01:40:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:50,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1151 transitions. [2025-03-14 01:40:50,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8699924414210128 [2025-03-14 01:40:50,102 INFO L175 Difference]: Start difference. First operand has 417 places, 491 transitions, 1425 flow. Second operand 3 states and 1151 transitions. [2025-03-14 01:40:50,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 499 transitions, 1523 flow [2025-03-14 01:40:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 499 transitions, 1523 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:40:50,111 INFO L231 Difference]: Finished difference. Result has 420 places, 491 transitions, 1436 flow [2025-03-14 01:40:50,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=420, PETRI_TRANSITIONS=491} [2025-03-14 01:40:50,112 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 19 predicate places. [2025-03-14 01:40:50,115 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 491 transitions, 1436 flow [2025-03-14 01:40:50,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:50,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:50,116 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-14 01:40:50,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:40:50,117 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-14 01:40:50,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash 166126883, now seen corresponding path program 1 times [2025-03-14 01:40:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:50,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977586730] [2025-03-14 01:40:50,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:50,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:50,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:40:50,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:40:50,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:50,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:50,282 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-14 01:40:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977586730] [2025-03-14 01:40:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977586730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256050644] [2025-03-14 01:40:50,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:50,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:50,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:50,285 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-14 01:40:50,287 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-14 01:40:50,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:40:50,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:40:50,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:50,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:50,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:40:50,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:50,521 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-14 01:40:50,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:50,622 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-14 01:40:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256050644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:50,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:50,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:40:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974135183] [2025-03-14 01:40:50,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:40:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:50,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:40:50,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:40:50,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 441 [2025-03-14 01:40:50,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 491 transitions, 1436 flow. Second operand has 18 states, 18 states have (on average 368.94444444444446) internal successors, (6641), 18 states have internal predecessors, (6641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:50,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:50,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 441 [2025-03-14 01:40:50,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:51,239 INFO L124 PetriNetUnfolderBase]: 369/3104 cut-off events. [2025-03-14 01:40:51,240 INFO L125 PetriNetUnfolderBase]: For 169/208 co-relation queries the response was YES. [2025-03-14 01:40:51,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 3104 events. 369/3104 cut-off events. For 169/208 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 27781 event pairs, 136 based on Foata normal form. 4/2869 useless extension candidates. Maximal degree in co-relation 4380. Up to 596 conditions per place. [2025-03-14 01:40:51,264 INFO L140 encePairwiseOnDemand]: 435/441 looper letters, 39 selfloop transitions, 21 changer transitions 0/509 dead transitions. [2025-03-14 01:40:51,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 509 transitions, 1644 flow [2025-03-14 01:40:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:40:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:40:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7771 transitions. [2025-03-14 01:40:51,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8391102472735126 [2025-03-14 01:40:51,279 INFO L175 Difference]: Start difference. First operand has 420 places, 491 transitions, 1436 flow. Second operand 21 states and 7771 transitions. [2025-03-14 01:40:51,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 509 transitions, 1644 flow [2025-03-14 01:40:51,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 509 transitions, 1638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:40:51,292 INFO L231 Difference]: Finished difference. Result has 443 places, 504 transitions, 1560 flow [2025-03-14 01:40:51,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1560, PETRI_PLACES=443, PETRI_TRANSITIONS=504} [2025-03-14 01:40:51,294 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 42 predicate places. [2025-03-14 01:40:51,294 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 504 transitions, 1560 flow [2025-03-14 01:40:51,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 368.94444444444446) internal successors, (6641), 18 states have internal predecessors, (6641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:51,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:51,299 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-14 01:40:51,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:40:51,500 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-14 01:40:51,500 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-14 01:40:51,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2072461725, now seen corresponding path program 2 times [2025-03-14 01:40:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036322493] [2025-03-14 01:40:51,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:51,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-14 01:40:51,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:40:51,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:40:51,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:51,800 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-14 01:40:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036322493] [2025-03-14 01:40:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036322493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369721700] [2025-03-14 01:40:51,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:51,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:51,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:51,803 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-14 01:40:51,806 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-14 01:40:51,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-14 01:40:51,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-03-14 01:40:51,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:40:51,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:51,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:40:51,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:51,978 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-14 01:40:51,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:52,159 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-14 01:40:52,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369721700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:52,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:52,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:40:52,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50643983] [2025-03-14 01:40:52,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:52,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:40:52,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:52,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:40:52,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:40:52,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 441 [2025-03-14 01:40:52,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 504 transitions, 1560 flow. Second operand has 23 states, 23 states have (on average 369.04347826086956) internal successors, (8488), 23 states have internal predecessors, (8488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:52,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:52,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 441 [2025-03-14 01:40:52,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:52,794 INFO L124 PetriNetUnfolderBase]: 369/3119 cut-off events. [2025-03-14 01:40:52,794 INFO L125 PetriNetUnfolderBase]: For 270/309 co-relation queries the response was YES. [2025-03-14 01:40:52,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4682 conditions, 3119 events. 369/3119 cut-off events. For 270/309 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 27711 event pairs, 136 based on Foata normal form. 3/2883 useless extension candidates. Maximal degree in co-relation 4380. Up to 596 conditions per place. [2025-03-14 01:40:52,808 INFO L140 encePairwiseOnDemand]: 435/441 looper letters, 42 selfloop transitions, 30 changer transitions 0/521 dead transitions. [2025-03-14 01:40:52,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 521 transitions, 1832 flow [2025-03-14 01:40:52,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:40:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:40:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11085 transitions. [2025-03-14 01:40:52,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8378684807256236 [2025-03-14 01:40:52,824 INFO L175 Difference]: Start difference. First operand has 443 places, 504 transitions, 1560 flow. Second operand 30 states and 11085 transitions. [2025-03-14 01:40:52,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 521 transitions, 1832 flow [2025-03-14 01:40:52,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 521 transitions, 1802 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-14 01:40:52,835 INFO L231 Difference]: Finished difference. Result has 470 places, 514 transitions, 1688 flow [2025-03-14 01:40:52,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1688, PETRI_PLACES=470, PETRI_TRANSITIONS=514} [2025-03-14 01:40:52,838 INFO L279 CegarLoopForPetriNet]: 401 programPoint places, 69 predicate places. [2025-03-14 01:40:52,838 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 514 transitions, 1688 flow [2025-03-14 01:40:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 369.04347826086956) internal successors, (8488), 23 states have internal predecessors, (8488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:52,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:52,841 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-14 01:40:52,847 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-14 01:40:53,041 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-14 01:40:53,042 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-14 01:40:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash 129842692, now seen corresponding path program 3 times [2025-03-14 01:40:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518144942] [2025-03-14 01:40:53,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:40:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:53,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-03-14 01:40:53,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-03-14 01:40:53,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-14 01:40:53,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:40:53,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:40:53,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-14 01:40:53,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-14 01:40:53,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:53,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:40:53,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:40:53,166 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:40:53,167 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-03-14 01:40:53,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-03-14 01:40:53,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-03-14 01:40:53,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-03-14 01:40:53,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-03-14 01:40:53,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-03-14 01:40:53,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-03-14 01:40:53,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-03-14 01:40:53,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-03-14 01:40:53,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-03-14 01:40:53,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-03-14 01:40:53,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-03-14 01:40:53,172 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-03-14 01:40:53,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:40:53,172 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-14 01:40:53,174 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:40:53,174 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:40:53,213 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:40:53,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 501 places, 554 transitions, 1124 flow [2025-03-14 01:40:53,323 INFO L124 PetriNetUnfolderBase]: 113/1047 cut-off events. [2025-03-14 01:40:53,323 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:40:53,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 1047 events. 113/1047 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6125 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 676. Up to 12 conditions per place. [2025-03-14 01:40:53,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 501 places, 554 transitions, 1124 flow [2025-03-14 01:40:53,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 501 places, 554 transitions, 1124 flow [2025-03-14 01:40:53,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:40:53,343 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;@3214e572, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:40:53,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-14 01:40:53,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:40:53,348 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-14 01:40:53,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:40:53,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:53,348 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-14 01:40:53,348 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-14 01:40:53,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2041909694, now seen corresponding path program 1 times [2025-03-14 01:40:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:53,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151249858] [2025-03-14 01:40:53,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:53,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:40:53,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:40:53,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:53,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:53,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-14 01:40:53,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:53,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151249858] [2025-03-14 01:40:53,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151249858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:53,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:53,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:40:53,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860974899] [2025-03-14 01:40:53,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:53,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:53,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:53,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:53,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:53,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 554 [2025-03-14 01:40:53,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 554 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:53,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:53,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 554 [2025-03-14 01:40:53,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:55,892 INFO L124 PetriNetUnfolderBase]: 3251/22680 cut-off events. [2025-03-14 01:40:55,893 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-03-14 01:40:55,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27460 conditions, 22680 events. 3251/22680 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 307936 event pairs, 2680 based on Foata normal form. 4169/24938 useless extension candidates. Maximal degree in co-relation 24550. Up to 4707 conditions per place. [2025-03-14 01:40:56,015 INFO L140 encePairwiseOnDemand]: 503/554 looper letters, 41 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2025-03-14 01:40:56,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 499 transitions, 1100 flow [2025-03-14 01:40:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1472 transitions. [2025-03-14 01:40:56,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856799037304453 [2025-03-14 01:40:56,018 INFO L175 Difference]: Start difference. First operand has 501 places, 554 transitions, 1124 flow. Second operand 3 states and 1472 transitions. [2025-03-14 01:40:56,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 499 transitions, 1100 flow [2025-03-14 01:40:56,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 499 transitions, 1100 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:40:56,025 INFO L231 Difference]: Finished difference. Result has 496 places, 499 transitions, 1024 flow [2025-03-14 01:40:56,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=496, PETRI_TRANSITIONS=499} [2025-03-14 01:40:56,026 INFO L279 CegarLoopForPetriNet]: 501 programPoint places, -5 predicate places. [2025-03-14 01:40:56,026 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 499 transitions, 1024 flow [2025-03-14 01:40:56,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 461.3333333333333) internal successors, (1384), 3 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:56,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:56,027 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-14 01:40:56,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:40:56,027 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-14 01:40:56,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash -595935019, now seen corresponding path program 1 times [2025-03-14 01:40:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516749026] [2025-03-14 01:40:56,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:56,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:56,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:56,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:56,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:56,098 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-14 01:40:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516749026] [2025-03-14 01:40:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516749026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097702456] [2025-03-14 01:40:56,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:56,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:56,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:56,102 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-14 01:40:56,104 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-14 01:40:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:56,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:56,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:56,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:56,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:40:56,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:56,209 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-14 01:40:56,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:56,240 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-14 01:40:56,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097702456] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:56,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:56,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:40:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691556446] [2025-03-14 01:40:56,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:56,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:40:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:56,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:40:56,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:40:56,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 457 out of 554 [2025-03-14 01:40:56,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 499 transitions, 1024 flow. Second operand has 10 states, 10 states have (on average 458.8) internal successors, (4588), 10 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:56,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:56,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 457 of 554 [2025-03-14 01:40:56,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:59,340 INFO L124 PetriNetUnfolderBase]: 3251/22687 cut-off events. [2025-03-14 01:40:59,340 INFO L125 PetriNetUnfolderBase]: For 152/156 co-relation queries the response was YES. [2025-03-14 01:40:59,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27486 conditions, 22687 events. 3251/22687 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 307812 event pairs, 2680 based on Foata normal form. 2/20778 useless extension candidates. Maximal degree in co-relation 27390. Up to 4707 conditions per place. [2025-03-14 01:40:59,464 INFO L140 encePairwiseOnDemand]: 548/554 looper letters, 45 selfloop transitions, 9 changer transitions 0/507 dead transitions. [2025-03-14 01:40:59,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 507 transitions, 1150 flow [2025-03-14 01:40:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:40:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:40:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4169 transitions. [2025-03-14 01:40:59,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8361411953469715 [2025-03-14 01:40:59,470 INFO L175 Difference]: Start difference. First operand has 496 places, 499 transitions, 1024 flow. Second operand 9 states and 4169 transitions. [2025-03-14 01:40:59,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 507 transitions, 1150 flow [2025-03-14 01:40:59,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 507 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:40:59,476 INFO L231 Difference]: Finished difference. Result has 506 places, 505 transitions, 1072 flow [2025-03-14 01:40:59,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1072, PETRI_PLACES=506, PETRI_TRANSITIONS=505} [2025-03-14 01:40:59,478 INFO L279 CegarLoopForPetriNet]: 501 programPoint places, 5 predicate places. [2025-03-14 01:40:59,478 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 505 transitions, 1072 flow [2025-03-14 01:40:59,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 458.8) internal successors, (4588), 10 states have internal predecessors, (4588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:40:59,479 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:59,480 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-14 01:40:59,486 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-14 01:40:59,680 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-14 01:40:59,681 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-14 01:40:59,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1533863541, now seen corresponding path program 2 times [2025-03-14 01:40:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:59,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800559296] [2025-03-14 01:40:59,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:59,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-14 01:40:59,693 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-03-14 01:40:59,693 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:40:59,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:59,877 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-14 01:40:59,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:59,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800559296] [2025-03-14 01:40:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800559296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:40:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608849602] [2025-03-14 01:40:59,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:59,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:40:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:59,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:40:59,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:41:00,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 554 [2025-03-14 01:41:00,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 505 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 369.5) internal successors, (2217), 6 states have internal predecessors, (2217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:41:00,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:00,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 554 [2025-03-14 01:41:00,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand