./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.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_70-funloop_racefree.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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:40:39,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:40:39,512 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:39,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:40:39,516 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:40:39,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:40:39,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:40:39,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:40:39,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:40:39,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:40:39,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:40:39,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:40:39,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:40:39,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:40:39,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:40:39,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:40:39,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:40:39,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:40:39,542 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-03-14 01:40:39,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:40:39,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:40:39,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:40:39,777 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:40:39,778 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:40:39,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-14 01:40:40,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27adcf65/e29f8f4ab3894dbcb26b59aba597fb5e/FLAGac19f838d [2025-03-14 01:40:41,215 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:40:41,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-14 01:40:41,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27adcf65/e29f8f4ab3894dbcb26b59aba597fb5e/FLAGac19f838d [2025-03-14 01:40:41,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27adcf65/e29f8f4ab3894dbcb26b59aba597fb5e [2025-03-14 01:40:41,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:40:41,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:40:41,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:40:41,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:40:41,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:40:41,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:40:41" (1/1) ... [2025-03-14 01:40:41,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb708eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:41, skipping insertion in model container [2025-03-14 01:40:41,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:40:41" (1/1) ... [2025-03-14 01:40:41,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:40:41,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:40:41,874 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:40:41,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:40:41,965 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:40:41,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:41 WrapperNode [2025-03-14 01:40:41,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:40:41,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:40:41,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:40:41,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:40:41,972 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:41" (1/1) ... [2025-03-14 01:40:41,988 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:41" (1/1) ... [2025-03-14 01:40:42,024 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 325 [2025-03-14 01:40:42,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:40:42,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:40:42,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:40:42,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:40:42,033 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:41" (1/1) ... [2025-03-14 01:40:42,035 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:41" (1/1) ... [2025-03-14 01:40:42,041 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:41" (1/1) ... [2025-03-14 01:40:42,043 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:41" (1/1) ... [2025-03-14 01:40:42,062 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:41" (1/1) ... [2025-03-14 01:40:42,064 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:41" (1/1) ... [2025-03-14 01:40:42,065 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:41" (1/1) ... [2025-03-14 01:40:42,068 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:41" (1/1) ... [2025-03-14 01:40:42,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:40:42,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:40:42,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:40:42,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:40:42,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:41" (1/1) ... [2025-03-14 01:40:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:40:42,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:42,102 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:42,105 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:42,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:40:42,124 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:40:42,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:40:42,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:40:42,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:40:42,126 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:42,243 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:40:42,244 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:40:42,572 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-14 01:40:42,572 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-14 01:40:42,674 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:40:42,675 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:40:42,675 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:40:42,703 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:40:42,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:40:42 BoogieIcfgContainer [2025-03-14 01:40:42,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:40:42,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:40:42,706 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:40:42,710 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:40:42,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:40:41" (1/3) ... [2025-03-14 01:40:42,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74787a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:40:42, skipping insertion in model container [2025-03-14 01:40:42,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:40:41" (2/3) ... [2025-03-14 01:40:42,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74787a15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:40:42, skipping insertion in model container [2025-03-14 01:40:42,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:40:42" (3/3) ... [2025-03-14 01:40:42,712 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-03-14 01:40:42,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:40:42,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 315 locations, 1 initial locations, 13 loop locations, and 12 error locations. [2025-03-14 01:40:42,725 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:40:42,817 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:40:42,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 345 transitions, 697 flow [2025-03-14 01:40:42,982 INFO L124 PetriNetUnfolderBase]: 44/482 cut-off events. [2025-03-14 01:40:42,986 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:40:42,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 482 events. 44/482 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1867 event pairs, 0 based on Foata normal form. 0/416 useless extension candidates. Maximal degree in co-relation 251. Up to 8 conditions per place. [2025-03-14 01:40:43,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 318 places, 345 transitions, 697 flow [2025-03-14 01:40:43,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 345 transitions, 697 flow [2025-03-14 01:40:43,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:40:43,021 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;@62c715db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:40:43,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-14 01:40:43,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:40:43,048 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-14 01:40:43,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:40:43,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:43,049 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:43,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-14 01:40:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1414722519, now seen corresponding path program 1 times [2025-03-14 01:40:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:43,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961202556] [2025-03-14 01:40:43,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:43,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:40:43,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:40:43,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:43,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:43,400 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:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961202556] [2025-03-14 01:40:43,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961202556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:43,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:43,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:40:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325221976] [2025-03-14 01:40:43,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:43,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:43,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:43,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:43,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 345 [2025-03-14 01:40:43,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 345 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:43,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:43,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 345 [2025-03-14 01:40:43,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:43,677 INFO L124 PetriNetUnfolderBase]: 98/1371 cut-off events. [2025-03-14 01:40:43,677 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2025-03-14 01:40:43,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 1371 events. 98/1371 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8933 event pairs, 72 based on Foata normal form. 159/1415 useless extension candidates. Maximal degree in co-relation 1320. Up to 187 conditions per place. [2025-03-14 01:40:43,688 INFO L140 encePairwiseOnDemand]: 318/345 looper letters, 23 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-03-14 01:40:43,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 318 transitions, 693 flow [2025-03-14 01:40:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:43,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2025-03-14 01:40:43,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9033816425120773 [2025-03-14 01:40:43,706 INFO L175 Difference]: Start difference. First operand has 318 places, 345 transitions, 697 flow. Second operand 3 states and 935 transitions. [2025-03-14 01:40:43,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 318 transitions, 693 flow [2025-03-14 01:40:43,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 318 transitions, 693 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:40:43,718 INFO L231 Difference]: Finished difference. Result has 317 places, 318 transitions, 653 flow [2025-03-14 01:40:43,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=317, PETRI_TRANSITIONS=318} [2025-03-14 01:40:43,723 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, -1 predicate places. [2025-03-14 01:40:43,724 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 318 transitions, 653 flow [2025-03-14 01:40:43,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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:43,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:43,725 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:43,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:40:43,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-14 01:40:43,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:43,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1009974240, now seen corresponding path program 1 times [2025-03-14 01:40:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577865896] [2025-03-14 01:40:43,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:43,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:43,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:43,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:43,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:43,934 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:43,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577865896] [2025-03-14 01:40:43,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577865896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:43,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719082310] [2025-03-14 01:40:43,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:43,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:43,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:43,940 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:43,941 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:43,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:44,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:44,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:44,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:44,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:40:44,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:44,090 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:44,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:44,127 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:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719082310] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:44,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:40:44,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057083621] [2025-03-14 01:40:44,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:44,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:40:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:44,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:40:44,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:40:44,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 345 [2025-03-14 01:40:44,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 318 transitions, 653 flow. Second operand has 10 states, 10 states have (on average 293.8) internal successors, (2938), 10 states have internal predecessors, (2938), 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:44,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:44,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 345 [2025-03-14 01:40:44,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:44,435 INFO L124 PetriNetUnfolderBase]: 98/1378 cut-off events. [2025-03-14 01:40:44,435 INFO L125 PetriNetUnfolderBase]: For 5/8 co-relation queries the response was YES. [2025-03-14 01:40:44,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 1378 events. 98/1378 cut-off events. For 5/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8936 event pairs, 72 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 1495. Up to 187 conditions per place. [2025-03-14 01:40:44,443 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 27 selfloop transitions, 9 changer transitions 0/326 dead transitions. [2025-03-14 01:40:44,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 326 transitions, 743 flow [2025-03-14 01:40:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:40:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:40:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2666 transitions. [2025-03-14 01:40:44,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8586151368760064 [2025-03-14 01:40:44,453 INFO L175 Difference]: Start difference. First operand has 317 places, 318 transitions, 653 flow. Second operand 9 states and 2666 transitions. [2025-03-14 01:40:44,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 326 transitions, 743 flow [2025-03-14 01:40:44,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 326 transitions, 741 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:40:44,461 INFO L231 Difference]: Finished difference. Result has 327 places, 324 transitions, 701 flow [2025-03-14 01:40:44,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=701, PETRI_PLACES=327, PETRI_TRANSITIONS=324} [2025-03-14 01:40:44,462 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 9 predicate places. [2025-03-14 01:40:44,462 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 324 transitions, 701 flow [2025-03-14 01:40:44,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 293.8) internal successors, (2938), 10 states have internal predecessors, (2938), 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:44,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:44,464 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:44,472 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:44,669 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:44,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-14 01:40:44,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1510720128, now seen corresponding path program 2 times [2025-03-14 01:40:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:44,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981017844] [2025-03-14 01:40:44,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:44,687 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-14 01:40:44,702 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:44,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:40:44,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:45,293 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:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981017844] [2025-03-14 01:40:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981017844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:45,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:45,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:40:45,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552721928] [2025-03-14 01:40:45,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:45,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:40:45,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:45,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:40:45,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:40:45,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 345 [2025-03-14 01:40:45,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 324 transitions, 701 flow. Second operand has 6 states, 6 states have (on average 244.5) internal successors, (1467), 6 states have internal predecessors, (1467), 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,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:45,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 345 [2025-03-14 01:40:45,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:46,604 INFO L124 PetriNetUnfolderBase]: 1447/5905 cut-off events. [2025-03-14 01:40:46,604 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:40:46,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8800 conditions, 5905 events. 1447/5905 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 54160 event pairs, 1036 based on Foata normal form. 0/5386 useless extension candidates. Maximal degree in co-relation 8676. Up to 2633 conditions per place. [2025-03-14 01:40:46,629 INFO L140 encePairwiseOnDemand]: 318/345 looper letters, 107 selfloop transitions, 86 changer transitions 0/441 dead transitions. [2025-03-14 01:40:46,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 441 transitions, 1321 flow [2025-03-14 01:40:46,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:40:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:40:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1652 transitions. [2025-03-14 01:40:46,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7980676328502415 [2025-03-14 01:40:46,632 INFO L175 Difference]: Start difference. First operand has 327 places, 324 transitions, 701 flow. Second operand 6 states and 1652 transitions. [2025-03-14 01:40:46,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 441 transitions, 1321 flow [2025-03-14 01:40:46,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 441 transitions, 1315 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:40:46,641 INFO L231 Difference]: Finished difference. Result has 336 places, 409 transitions, 1261 flow [2025-03-14 01:40:46,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1261, PETRI_PLACES=336, PETRI_TRANSITIONS=409} [2025-03-14 01:40:46,642 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 18 predicate places. [2025-03-14 01:40:46,642 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 409 transitions, 1261 flow [2025-03-14 01:40:46,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.5) internal successors, (1467), 6 states have internal predecessors, (1467), 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,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:46,644 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] [2025-03-14 01:40:46,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:40:46,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-14 01:40:46,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:46,645 INFO L85 PathProgramCache]: Analyzing trace with hash 426240535, now seen corresponding path program 1 times [2025-03-14 01:40:46,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:46,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414006817] [2025-03-14 01:40:46,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:46,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:40:46,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:40:46,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:46,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:46,709 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:46,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:46,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414006817] [2025-03-14 01:40:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414006817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:46,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:40:46,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054081285] [2025-03-14 01:40:46,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:46,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:46,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:46,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:46,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 345 [2025-03-14 01:40:46,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 409 transitions, 1261 flow. Second operand has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:46,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 345 [2025-03-14 01:40:46,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:46,955 INFO L124 PetriNetUnfolderBase]: 322/2280 cut-off events. [2025-03-14 01:40:46,956 INFO L125 PetriNetUnfolderBase]: For 156/170 co-relation queries the response was YES. [2025-03-14 01:40:46,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 2280 events. 322/2280 cut-off events. For 156/170 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17813 event pairs, 55 based on Foata normal form. 1/2098 useless extension candidates. Maximal degree in co-relation 3162. Up to 266 conditions per place. [2025-03-14 01:40:46,970 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 30 selfloop transitions, 3 changer transitions 0/417 dead transitions. [2025-03-14 01:40:46,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 417 transitions, 1343 flow [2025-03-14 01:40:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:46,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 918 transitions. [2025-03-14 01:40:46,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8869565217391304 [2025-03-14 01:40:46,974 INFO L175 Difference]: Start difference. First operand has 336 places, 409 transitions, 1261 flow. Second operand 3 states and 918 transitions. [2025-03-14 01:40:46,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 417 transitions, 1343 flow [2025-03-14 01:40:46,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 417 transitions, 1343 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:40:46,986 INFO L231 Difference]: Finished difference. Result has 339 places, 409 transitions, 1272 flow [2025-03-14 01:40:46,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=339, PETRI_TRANSITIONS=409} [2025-03-14 01:40:46,988 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 21 predicate places. [2025-03-14 01:40:46,988 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 409 transitions, 1272 flow [2025-03-14 01:40:46,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.3333333333333) internal successors, (889), 3 states have internal predecessors, (889), 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,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:46,989 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:46,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:40:46,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-14 01:40:46,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1576673986, now seen corresponding path program 1 times [2025-03-14 01:40:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850956642] [2025-03-14 01:40:46,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:47,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:40:47,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:40:47,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:47,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:47,149 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:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850956642] [2025-03-14 01:40:47,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850956642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740205390] [2025-03-14 01:40:47,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:47,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:47,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:47,152 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:47,154 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:47,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-14 01:40:47,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-14 01:40:47,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:47,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:47,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:40:47,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:47,285 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:47,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:47,367 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:47,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740205390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:47,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:47,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-14 01:40:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921544672] [2025-03-14 01:40:47,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:47,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 01:40:47,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:47,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 01:40:47,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-14 01:40:47,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 345 [2025-03-14 01:40:47,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 409 transitions, 1272 flow. Second operand has 18 states, 18 states have (on average 293.94444444444446) internal successors, (5291), 18 states have internal predecessors, (5291), 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,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:47,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 345 [2025-03-14 01:40:47,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:47,762 INFO L124 PetriNetUnfolderBase]: 273/2183 cut-off events. [2025-03-14 01:40:47,762 INFO L125 PetriNetUnfolderBase]: For 168/209 co-relation queries the response was YES. [2025-03-14 01:40:47,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3342 conditions, 2183 events. 273/2183 cut-off events. For 168/209 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17092 event pairs, 72 based on Foata normal form. 4/2026 useless extension candidates. Maximal degree in co-relation 3140. Up to 436 conditions per place. [2025-03-14 01:40:47,773 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 31 selfloop transitions, 21 changer transitions 0/427 dead transitions. [2025-03-14 01:40:47,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 427 transitions, 1464 flow [2025-03-14 01:40:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 01:40:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 01:40:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6188 transitions. [2025-03-14 01:40:47,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541062801932368 [2025-03-14 01:40:47,782 INFO L175 Difference]: Start difference. First operand has 339 places, 409 transitions, 1272 flow. Second operand 21 states and 6188 transitions. [2025-03-14 01:40:47,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 427 transitions, 1464 flow [2025-03-14 01:40:47,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 427 transitions, 1458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:40:47,790 INFO L231 Difference]: Finished difference. Result has 362 places, 422 transitions, 1396 flow [2025-03-14 01:40:47,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1396, PETRI_PLACES=362, PETRI_TRANSITIONS=422} [2025-03-14 01:40:47,791 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 44 predicate places. [2025-03-14 01:40:47,791 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 422 transitions, 1396 flow [2025-03-14 01:40:47,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 293.94444444444446) internal successors, (5291), 18 states have internal predecessors, (5291), 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,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:47,794 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:47,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 01:40:47,994 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:47,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-14 01:40:47,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2067396098, now seen corresponding path program 2 times [2025-03-14 01:40:47,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:47,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370028986] [2025-03-14 01:40:47,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:48,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-14 01:40:48,024 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:48,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:40:48,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:48,329 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:48,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370028986] [2025-03-14 01:40:48,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370028986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:48,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662992265] [2025-03-14 01:40:48,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:48,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:48,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:48,335 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:48,341 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:48,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-03-14 01:40:48,449 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:48,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:40:48,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:48,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:40:48,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:48,542 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:48,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:48,729 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:48,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662992265] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:48,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:48,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-14 01:40:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982177905] [2025-03-14 01:40:48,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:48,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-14 01:40:48,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:48,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-14 01:40:48,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-14 01:40:48,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 345 [2025-03-14 01:40:48,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 422 transitions, 1396 flow. Second operand has 23 states, 23 states have (on average 294.04347826086956) internal successors, (6763), 23 states have internal predecessors, (6763), 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,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:48,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 345 [2025-03-14 01:40:48,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:49,254 INFO L124 PetriNetUnfolderBase]: 273/2198 cut-off events. [2025-03-14 01:40:49,254 INFO L125 PetriNetUnfolderBase]: For 269/310 co-relation queries the response was YES. [2025-03-14 01:40:49,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3442 conditions, 2198 events. 273/2198 cut-off events. For 269/310 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17068 event pairs, 72 based on Foata normal form. 3/2040 useless extension candidates. Maximal degree in co-relation 3140. Up to 436 conditions per place. [2025-03-14 01:40:49,269 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 34 selfloop transitions, 30 changer transitions 0/439 dead transitions. [2025-03-14 01:40:49,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 439 transitions, 1652 flow [2025-03-14 01:40:49,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 01:40:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 01:40:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8827 transitions. [2025-03-14 01:40:49,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8528502415458937 [2025-03-14 01:40:49,282 INFO L175 Difference]: Start difference. First operand has 362 places, 422 transitions, 1396 flow. Second operand 30 states and 8827 transitions. [2025-03-14 01:40:49,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 439 transitions, 1652 flow [2025-03-14 01:40:49,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 439 transitions, 1622 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-14 01:40:49,322 INFO L231 Difference]: Finished difference. Result has 389 places, 432 transitions, 1524 flow [2025-03-14 01:40:49,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1524, PETRI_PLACES=389, PETRI_TRANSITIONS=432} [2025-03-14 01:40:49,325 INFO L279 CegarLoopForPetriNet]: 318 programPoint places, 71 predicate places. [2025-03-14 01:40:49,326 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 432 transitions, 1524 flow [2025-03-14 01:40:49,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 294.04347826086956) internal successors, (6763), 23 states have internal predecessors, (6763), 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,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:49,328 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:49,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 01:40:49,532 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:49,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-14 01:40:49,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:49,533 INFO L85 PathProgramCache]: Analyzing trace with hash 733603947, now seen corresponding path program 3 times [2025-03-14 01:40:49,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:49,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930688718] [2025-03-14 01:40:49,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:40:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:49,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-03-14 01:40:49,590 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:49,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-14 01:40:49,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:40:49,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:40:49,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-14 01:40:49,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-14 01:40:49,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:49,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:40:49,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:40:49,635 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:40:49,636 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-14 01:40:49,637 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-14 01:40:49,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-14 01:40:49,638 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-14 01:40:49,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-14 01:40:49,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-14 01:40:49,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-14 01:40:49,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-14 01:40:49,639 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-14 01:40:49,640 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-14 01:40:49,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:40:49,643 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-14 01:40:49,645 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:40:49,645 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:40:49,679 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:40:49,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 418 places, 458 transitions, 932 flow [2025-03-14 01:40:49,744 INFO L124 PetriNetUnfolderBase]: 74/759 cut-off events. [2025-03-14 01:40:49,744 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:40:49,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 759 events. 74/759 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3719 event pairs, 0 based on Foata normal form. 0/649 useless extension candidates. Maximal degree in co-relation 484. Up to 12 conditions per place. [2025-03-14 01:40:49,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 418 places, 458 transitions, 932 flow [2025-03-14 01:40:49,757 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 418 places, 458 transitions, 932 flow [2025-03-14 01:40:49,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:40:49,759 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;@62c715db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:40:49,759 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-14 01:40:49,765 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:40:49,765 INFO L124 PetriNetUnfolderBase]: 1/117 cut-off events. [2025-03-14 01:40:49,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:40:49,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:49,765 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:49,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:40:49,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1780855775, now seen corresponding path program 1 times [2025-03-14 01:40:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681933023] [2025-03-14 01:40:49,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:49,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-14 01:40:49,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-14 01:40:49,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:49,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:49,803 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:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:49,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681933023] [2025-03-14 01:40:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681933023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:40:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664704855] [2025-03-14 01:40:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:49,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:40:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:49,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:40:49,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:40:49,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 458 [2025-03-14 01:40:49,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 458 transitions, 932 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:49,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 458 [2025-03-14 01:40:49,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:51,145 INFO L124 PetriNetUnfolderBase]: 1782/12784 cut-off events. [2025-03-14 01:40:51,145 INFO L125 PetriNetUnfolderBase]: For 129/139 co-relation queries the response was YES. [2025-03-14 01:40:51,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15448 conditions, 12784 events. 1782/12784 cut-off events. For 129/139 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 155540 event pairs, 1464 based on Foata normal form. 2247/13949 useless extension candidates. Maximal degree in co-relation 13708. Up to 2601 conditions per place. [2025-03-14 01:40:51,237 INFO L140 encePairwiseOnDemand]: 419/458 looper letters, 33 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2025-03-14 01:40:51,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 417 transitions, 920 flow [2025-03-14 01:40:51,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:40:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:40:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1227 transitions. [2025-03-14 01:40:51,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8930131004366813 [2025-03-14 01:40:51,240 INFO L175 Difference]: Start difference. First operand has 418 places, 458 transitions, 932 flow. Second operand 3 states and 1227 transitions. [2025-03-14 01:40:51,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 417 transitions, 920 flow [2025-03-14 01:40:51,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 417 transitions, 920 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:40:51,245 INFO L231 Difference]: Finished difference. Result has 415 places, 417 transitions, 860 flow [2025-03-14 01:40:51,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=415, PETRI_TRANSITIONS=417} [2025-03-14 01:40:51,246 INFO L279 CegarLoopForPetriNet]: 418 programPoint places, -3 predicate places. [2025-03-14 01:40:51,246 INFO L471 AbstractCegarLoop]: Abstraction has has 415 places, 417 transitions, 860 flow [2025-03-14 01:40:51,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:51,247 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:51,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:40:51,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:40:51,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash 561019232, now seen corresponding path program 1 times [2025-03-14 01:40:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:51,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977813060] [2025-03-14 01:40:51,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:51,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:51,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:51,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:51,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:51,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:51,368 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:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977813060] [2025-03-14 01:40:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977813060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:40:51,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794552367] [2025-03-14 01:40:51,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:40:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:40:51,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:40:51,374 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:51,376 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:51,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-14 01:40:51,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-14 01:40:51,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:40:51,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:51,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:40:51,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:40:51,486 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:51,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:40:51,512 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:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794552367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:40:51,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:40:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:40:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21694839] [2025-03-14 01:40:51,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:40:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:40:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:51,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:40:51,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:40:51,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 458 [2025-03-14 01:40:51,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 417 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 383.8) internal successors, (3838), 10 states have internal predecessors, (3838), 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,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:51,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 458 [2025-03-14 01:40:51,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:40:53,200 INFO L124 PetriNetUnfolderBase]: 1782/12791 cut-off events. [2025-03-14 01:40:53,200 INFO L125 PetriNetUnfolderBase]: For 124/134 co-relation queries the response was YES. [2025-03-14 01:40:53,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15474 conditions, 12791 events. 1782/12791 cut-off events. For 124/134 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 155472 event pairs, 1464 based on Foata normal form. 2/11711 useless extension candidates. Maximal degree in co-relation 15378. Up to 2601 conditions per place. [2025-03-14 01:40:53,285 INFO L140 encePairwiseOnDemand]: 452/458 looper letters, 37 selfloop transitions, 9 changer transitions 0/425 dead transitions. [2025-03-14 01:40:53,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 425 transitions, 970 flow [2025-03-14 01:40:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:40:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:40:53,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3486 transitions. [2025-03-14 01:40:53,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457059679767104 [2025-03-14 01:40:53,291 INFO L175 Difference]: Start difference. First operand has 415 places, 417 transitions, 860 flow. Second operand 9 states and 3486 transitions. [2025-03-14 01:40:53,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 425 transitions, 970 flow [2025-03-14 01:40:53,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 425 transitions, 968 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:40:53,296 INFO L231 Difference]: Finished difference. Result has 425 places, 423 transitions, 908 flow [2025-03-14 01:40:53,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=908, PETRI_PLACES=425, PETRI_TRANSITIONS=423} [2025-03-14 01:40:53,297 INFO L279 CegarLoopForPetriNet]: 418 programPoint places, 7 predicate places. [2025-03-14 01:40:53,298 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 423 transitions, 908 flow [2025-03-14 01:40:53,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 383.8) internal successors, (3838), 10 states have internal predecessors, (3838), 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,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:40:53,299 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:53,404 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:53,499 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:53,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:40:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:40:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -117856768, now seen corresponding path program 2 times [2025-03-14 01:40:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:40:53,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234995916] [2025-03-14 01:40:53,500 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:40:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:40:53,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-14 01:40:53,512 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:53,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:40:53,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:40:53,727 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:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:40:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234995916] [2025-03-14 01:40:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234995916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:40:53,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:40:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:40:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570744323] [2025-03-14 01:40:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:40:53,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:40:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:40:53,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:40:53,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:40:53,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 458 [2025-03-14 01:40:53,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 423 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:40:53,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 458 [2025-03-14 01:40:53,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:41:16,083 INFO L124 PetriNetUnfolderBase]: 86364/210876 cut-off events. [2025-03-14 01:41:16,083 INFO L125 PetriNetUnfolderBase]: For 1319/1319 co-relation queries the response was YES. [2025-03-14 01:41:16,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339495 conditions, 210876 events. 86364/210876 cut-off events. For 1319/1319 co-relation queries the response was YES. Maximal size of possible extension queue 4080. Compared 2857919 event pairs, 59516 based on Foata normal form. 0/196037 useless extension candidates. Maximal degree in co-relation 339370. Up to 120095 conditions per place. [2025-03-14 01:41:17,656 INFO L140 encePairwiseOnDemand]: 411/458 looper letters, 170 selfloop transitions, 166 changer transitions 0/653 dead transitions. [2025-03-14 01:41:17,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 653 transitions, 2045 flow [2025-03-14 01:41:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:41:17,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:41:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2215 transitions. [2025-03-14 01:41:17,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8060407569141194 [2025-03-14 01:41:17,660 INFO L175 Difference]: Start difference. First operand has 425 places, 423 transitions, 908 flow. Second operand 6 states and 2215 transitions. [2025-03-14 01:41:17,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 653 transitions, 2045 flow [2025-03-14 01:41:17,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 653 transitions, 2039 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:41:17,675 INFO L231 Difference]: Finished difference. Result has 434 places, 588 transitions, 1988 flow [2025-03-14 01:41:17,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1988, PETRI_PLACES=434, PETRI_TRANSITIONS=588} [2025-03-14 01:41:17,677 INFO L279 CegarLoopForPetriNet]: 418 programPoint places, 16 predicate places. [2025-03-14 01:41:17,677 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 588 transitions, 1988 flow [2025-03-14 01:41:17,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 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:17,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:41:17,679 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] [2025-03-14 01:41:17,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:41:17,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-14 01:41:17,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:41:17,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1268046121, now seen corresponding path program 1 times [2025-03-14 01:41:17,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:41:17,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196167204] [2025-03-14 01:41:17,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:41:17,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:41:17,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-14 01:41:17,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-14 01:41:17,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:41:17,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:41:17,722 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:41:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:41:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196167204] [2025-03-14 01:41:17,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196167204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:41:17,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:41:17,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:41:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422219372] [2025-03-14 01:41:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:41:17,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:41:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:41:17,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:41:17,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:41:17,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 385 out of 458 [2025-03-14 01:41:17,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 588 transitions, 1988 flow. Second operand has 3 states, 3 states have (on average 386.3333333333333) internal successors, (1159), 3 states have internal predecessors, (1159), 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:17,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:41:17,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 385 of 458 [2025-03-14 01:41:17,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand