./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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_74-tricky_address1_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 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:02:47,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:02:47,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:02:47,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:02:47,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:02:47,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:02:47,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:02:47,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:02:47,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:02:47,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:02:47,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:02:47,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:02:47,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:02:47,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:02:47,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:02:47,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:47,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:02:47,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:02:47,184 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 -> 9a7db49c8892594e32a30fa9165fc3ad1a94911917cd8b63757bb8f24f04b536 [2025-03-08 22:02:47,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:02:47,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:02:47,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:02:47,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:02:47,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:02:47,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2025-03-08 22:02:48,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03758e044/2cf03b622a4241199d8e8ce3bc6149dd/FLAG98577f0c2 [2025-03-08 22:02:48,906 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:02:48,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2025-03-08 22:02:48,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03758e044/2cf03b622a4241199d8e8ce3bc6149dd/FLAG98577f0c2 [2025-03-08 22:02:49,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03758e044/2cf03b622a4241199d8e8ce3bc6149dd [2025-03-08 22:02:49,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:02:49,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:02:49,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:49,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:02:49,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:02:49,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a54b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49, skipping insertion in model container [2025-03-08 22:02:49,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:02:49,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:49,574 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:02:49,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:02:49,653 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:02:49,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49 WrapperNode [2025-03-08 22:02:49,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:02:49,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:49,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:02:49,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:02:49,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,700 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 326 [2025-03-08 22:02:49,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:02:49,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:02:49,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:02:49,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:02:49,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:02:49,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:02:49,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:02:49,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:02:49,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (1/1) ... [2025-03-08 22:02:49,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:02:49,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:49,767 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-08 22:02:49,770 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-08 22:02:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:02:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:02:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:02:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:02:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:02:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:02:49,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:02:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:02:49,787 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:02:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:02:49,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:02:49,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:02:49,788 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:02:49,903 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:02:49,906 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:02:50,252 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:02:50,253 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 22:02:50,358 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:02:50,359 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:02:50,417 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:02:50,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:02:50,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:50 BoogieIcfgContainer [2025-03-08 22:02:50,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:02:50,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:02:50,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:02:50,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:02:50,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:02:49" (1/3) ... [2025-03-08 22:02:50,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526748e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:50, skipping insertion in model container [2025-03-08 22:02:50,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:02:49" (2/3) ... [2025-03-08 22:02:50,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526748e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:02:50, skipping insertion in model container [2025-03-08 22:02:50,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:02:50" (3/3) ... [2025-03-08 22:02:50,429 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2025-03-08 22:02:50,439 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:02:50,440 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_74-tricky_address1_racefree.i that has 2 procedures, 316 locations, 1 initial locations, 11 loop locations, and 12 error locations. [2025-03-08 22:02:50,441 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:02:50,515 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:02:50,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 319 places, 346 transitions, 699 flow [2025-03-08 22:02:50,665 INFO L124 PetriNetUnfolderBase]: 43/472 cut-off events. [2025-03-08 22:02:50,666 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:02:50,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 472 events. 43/472 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1679 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 241. Up to 8 conditions per place. [2025-03-08 22:02:50,680 INFO L82 GeneralOperation]: Start removeDead. Operand has 319 places, 346 transitions, 699 flow [2025-03-08 22:02:50,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 346 transitions, 699 flow [2025-03-08 22:02:50,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:50,709 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;@7d032086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:50,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-08 22:02:50,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:50,726 INFO L124 PetriNetUnfolderBase]: 5/132 cut-off events. [2025-03-08 22:02:50,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:50,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:50,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:50,729 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-08 22:02:50,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:50,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1276997482, now seen corresponding path program 1 times [2025-03-08 22:02:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974075050] [2025-03-08 22:02:50,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:50,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 22:02:50,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 22:02:50,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:50,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:51,131 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-08 22:02:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974075050] [2025-03-08 22:02:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974075050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757311049] [2025-03-08 22:02:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:51,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:51,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:51,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:51,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 346 [2025-03-08 22:02:51,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 346 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-08 22:02:51,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:51,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 346 [2025-03-08 22:02:51,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:51,428 INFO L124 PetriNetUnfolderBase]: 85/1296 cut-off events. [2025-03-08 22:02:51,429 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 22:02:51,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 1296 events. 85/1296 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8262 event pairs, 72 based on Foata normal form. 165/1346 useless extension candidates. Maximal degree in co-relation 1237. Up to 178 conditions per place. [2025-03-08 22:02:51,440 INFO L140 encePairwiseOnDemand]: 317/346 looper letters, 23 selfloop transitions, 2 changer transitions 1/317 dead transitions. [2025-03-08 22:02:51,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 317 transitions, 691 flow [2025-03-08 22:02:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2025-03-08 22:02:51,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8998073217726397 [2025-03-08 22:02:51,459 INFO L175 Difference]: Start difference. First operand has 319 places, 346 transitions, 699 flow. Second operand 3 states and 934 transitions. [2025-03-08 22:02:51,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 317 transitions, 691 flow [2025-03-08 22:02:51,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 317 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:51,470 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 649 flow [2025-03-08 22:02:51,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2025-03-08 22:02:51,475 INFO L279 CegarLoopForPetriNet]: 319 programPoint places, -1 predicate places. [2025-03-08 22:02:51,476 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 649 flow [2025-03-08 22:02:51,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-08 22:02:51,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:51,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:51,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:02:51,478 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-08 22:02:51,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:51,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1057807750, now seen corresponding path program 1 times [2025-03-08 22:02:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:51,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301950615] [2025-03-08 22:02:51,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:51,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:51,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:51,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:51,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:51,680 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-08 22:02:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301950615] [2025-03-08 22:02:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301950615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:02:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353298889] [2025-03-08 22:02:51,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:02:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:51,683 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-08 22:02:51,685 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-08 22:02:51,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:51,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:51,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:51,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:51,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:02:51,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:02:51,831 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-08 22:02:51,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:02:51,871 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-08 22:02:51,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353298889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:02:51,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:02:51,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 22:02:51,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033803004] [2025-03-08 22:02:51,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:02:51,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:02:51,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:51,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:02:51,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:02:51,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 346 [2025-03-08 22:02:51,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 649 flow. Second operand has 10 states, 10 states have (on average 292.8) internal successors, (2928), 10 states have internal predecessors, (2928), 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-08 22:02:51,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:51,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 346 [2025-03-08 22:02:51,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:52,202 INFO L124 PetriNetUnfolderBase]: 85/1302 cut-off events. [2025-03-08 22:02:52,203 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 22:02:52,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1505 conditions, 1302 events. 85/1302 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8255 event pairs, 72 based on Foata normal form. 2/1190 useless extension candidates. Maximal degree in co-relation 1410. Up to 178 conditions per place. [2025-03-08 22:02:52,209 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 27 selfloop transitions, 9 changer transitions 0/324 dead transitions. [2025-03-08 22:02:52,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 739 flow [2025-03-08 22:02:52,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:02:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:02:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2657 transitions. [2025-03-08 22:02:52,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532434168272318 [2025-03-08 22:02:52,216 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 649 flow. Second operand 9 states and 2657 transitions. [2025-03-08 22:02:52,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 739 flow [2025-03-08 22:02:52,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 324 transitions, 737 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:52,221 INFO L231 Difference]: Finished difference. Result has 327 places, 322 transitions, 697 flow [2025-03-08 22:02:52,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=697, PETRI_PLACES=327, PETRI_TRANSITIONS=322} [2025-03-08 22:02:52,222 INFO L279 CegarLoopForPetriNet]: 319 programPoint places, 8 predicate places. [2025-03-08 22:02:52,222 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 322 transitions, 697 flow [2025-03-08 22:02:52,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 292.8) internal successors, (2928), 10 states have internal predecessors, (2928), 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-08 22:02:52,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:52,225 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:52,232 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-08 22:02:52,426 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-08 22:02:52,426 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-08 22:02:52,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1873060858, now seen corresponding path program 2 times [2025-03-08 22:02:52,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:52,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58991042] [2025-03-08 22:02:52,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:02:52,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:52,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-08 22:02:52,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 117 statements. [2025-03-08 22:02:52,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:02:52,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:53,043 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-08 22:02:53,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:53,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58991042] [2025-03-08 22:02:53,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58991042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:53,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:53,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:02:53,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301369587] [2025-03-08 22:02:53,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:53,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:02:53,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:53,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:02:53,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:02:53,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 346 [2025-03-08 22:02:53,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 322 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 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-08 22:02:53,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:53,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 346 [2025-03-08 22:02:53,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:54,136 INFO L124 PetriNetUnfolderBase]: 1365/5257 cut-off events. [2025-03-08 22:02:54,136 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-03-08 22:02:54,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8057 conditions, 5257 events. 1365/5257 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 46193 event pairs, 929 based on Foata normal form. 0/4835 useless extension candidates. Maximal degree in co-relation 7933. Up to 2547 conditions per place. [2025-03-08 22:02:54,157 INFO L140 encePairwiseOnDemand]: 319/346 looper letters, 107 selfloop transitions, 86 changer transitions 0/439 dead transitions. [2025-03-08 22:02:54,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 439 transitions, 1317 flow [2025-03-08 22:02:54,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:02:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:02:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1646 transitions. [2025-03-08 22:02:54,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7928709055876686 [2025-03-08 22:02:54,160 INFO L175 Difference]: Start difference. First operand has 327 places, 322 transitions, 697 flow. Second operand 6 states and 1646 transitions. [2025-03-08 22:02:54,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 439 transitions, 1317 flow [2025-03-08 22:02:54,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 439 transitions, 1311 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 22:02:54,167 INFO L231 Difference]: Finished difference. Result has 336 places, 407 transitions, 1257 flow [2025-03-08 22:02:54,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1257, PETRI_PLACES=336, PETRI_TRANSITIONS=407} [2025-03-08 22:02:54,169 INFO L279 CegarLoopForPetriNet]: 319 programPoint places, 17 predicate places. [2025-03-08 22:02:54,169 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 407 transitions, 1257 flow [2025-03-08 22:02:54,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 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-08 22:02:54,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:54,170 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:54,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:02:54,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2025-03-08 22:02:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash 825748829, now seen corresponding path program 1 times [2025-03-08 22:02:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533444553] [2025-03-08 22:02:54,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:54,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:02:54,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:02:54,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:54,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:54,233 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-08 22:02:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533444553] [2025-03-08 22:02:54,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533444553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:54,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:54,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:54,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494876726] [2025-03-08 22:02:54,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:54,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:54,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:54,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:54,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:54,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 346 [2025-03-08 22:02:54,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 407 transitions, 1257 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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-08 22:02:54,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:54,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 346 [2025-03-08 22:02:54,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:54,501 INFO L124 PetriNetUnfolderBase]: 235/1933 cut-off events. [2025-03-08 22:02:54,501 INFO L125 PetriNetUnfolderBase]: For 152/174 co-relation queries the response was YES. [2025-03-08 22:02:54,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 1933 events. 235/1933 cut-off events. For 152/174 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 14688 event pairs, 88 based on Foata normal form. 1/1775 useless extension candidates. Maximal degree in co-relation 2685. Up to 235 conditions per place. [2025-03-08 22:02:54,509 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 30 selfloop transitions, 3 changer transitions 0/415 dead transitions. [2025-03-08 22:02:54,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 415 transitions, 1339 flow [2025-03-08 22:02:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 915 transitions. [2025-03-08 22:02:54,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8815028901734104 [2025-03-08 22:02:54,512 INFO L175 Difference]: Start difference. First operand has 336 places, 407 transitions, 1257 flow. Second operand 3 states and 915 transitions. [2025-03-08 22:02:54,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 415 transitions, 1339 flow [2025-03-08 22:02:54,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 415 transitions, 1339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:54,520 INFO L231 Difference]: Finished difference. Result has 339 places, 407 transitions, 1268 flow [2025-03-08 22:02:54,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1268, PETRI_PLACES=339, PETRI_TRANSITIONS=407} [2025-03-08 22:02:54,522 INFO L279 CegarLoopForPetriNet]: 319 programPoint places, 20 predicate places. [2025-03-08 22:02:54,522 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 407 transitions, 1268 flow [2025-03-08 22:02:54,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 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-08 22:02:54,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:54,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:54,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:02:54,524 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-08 22:02:54,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2138860146, now seen corresponding path program 1 times [2025-03-08 22:02:54,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:54,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573719421] [2025-03-08 22:02:54,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:54,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 22:02:54,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 22:02:54,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:54,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:54,727 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-08 22:02:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573719421] [2025-03-08 22:02:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573719421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:02:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655230996] [2025-03-08 22:02:54,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:54,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:02:54,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:54,731 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-08 22:02:54,732 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-08 22:02:54,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 22:02:54,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 22:02:54,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:54,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:54,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:02:54,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:02:54,891 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-08 22:02:54,891 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:02:54,991 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-08 22:02:54,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655230996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:02:54,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:02:54,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 22:02:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167237097] [2025-03-08 22:02:54,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:02:54,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 22:02:54,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:54,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 22:02:54,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 22:02:55,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 346 [2025-03-08 22:02:55,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 407 transitions, 1268 flow. Second operand has 18 states, 18 states have (on average 292.94444444444446) internal successors, (5273), 18 states have internal predecessors, (5273), 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-08 22:02:55,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:55,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 346 [2025-03-08 22:02:55,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:55,455 INFO L124 PetriNetUnfolderBase]: 213/1901 cut-off events. [2025-03-08 22:02:55,455 INFO L125 PetriNetUnfolderBase]: For 158/192 co-relation queries the response was YES. [2025-03-08 22:02:55,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1901 events. 213/1901 cut-off events. For 158/192 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14207 event pairs, 72 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 2585. Up to 232 conditions per place. [2025-03-08 22:02:55,463 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 31 selfloop transitions, 21 changer transitions 0/425 dead transitions. [2025-03-08 22:02:55,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 425 transitions, 1460 flow [2025-03-08 22:02:55,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 22:02:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 22:02:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6167 transitions. [2025-03-08 22:02:55,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.848747591522158 [2025-03-08 22:02:55,473 INFO L175 Difference]: Start difference. First operand has 339 places, 407 transitions, 1268 flow. Second operand 21 states and 6167 transitions. [2025-03-08 22:02:55,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 425 transitions, 1460 flow [2025-03-08 22:02:55,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 425 transitions, 1454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:02:55,480 INFO L231 Difference]: Finished difference. Result has 362 places, 420 transitions, 1392 flow [2025-03-08 22:02:55,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1392, PETRI_PLACES=362, PETRI_TRANSITIONS=420} [2025-03-08 22:02:55,482 INFO L279 CegarLoopForPetriNet]: 319 programPoint places, 43 predicate places. [2025-03-08 22:02:55,482 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 420 transitions, 1392 flow [2025-03-08 22:02:55,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 292.94444444444446) internal successors, (5273), 18 states have internal predecessors, (5273), 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-08 22:02:55,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:55,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:55,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:02:55,685 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-08 22:02:55,685 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-08 22:02:55,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash 20042382, now seen corresponding path program 2 times [2025-03-08 22:02:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569173002] [2025-03-08 22:02:55,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:02:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:55,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-08 22:02:55,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:02:55,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:02:55,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:55,985 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-08 22:02:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569173002] [2025-03-08 22:02:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569173002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:02:55,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510651716] [2025-03-08 22:02:55,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:02:55,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:02:55,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:55,990 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-08 22:02:55,993 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-08 22:02:56,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 152 statements into 2 equivalence classes. [2025-03-08 22:02:56,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 22:02:56,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:02:56,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:56,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:02:56,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:02:56,177 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-08 22:02:56,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:02:56,337 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-08 22:02:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510651716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:02:56,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:02:56,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 22:02:56,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901262503] [2025-03-08 22:02:56,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:02:56,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 22:02:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:56,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 22:02:56,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 22:02:56,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 346 [2025-03-08 22:02:56,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 420 transitions, 1392 flow. Second operand has 23 states, 23 states have (on average 293.04347826086956) internal successors, (6740), 23 states have internal predecessors, (6740), 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-08 22:02:56,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:56,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 346 [2025-03-08 22:02:56,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:56,842 INFO L124 PetriNetUnfolderBase]: 213/1916 cut-off events. [2025-03-08 22:02:56,842 INFO L125 PetriNetUnfolderBase]: For 259/293 co-relation queries the response was YES. [2025-03-08 22:02:56,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2887 conditions, 1916 events. 213/1916 cut-off events. For 259/293 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14311 event pairs, 72 based on Foata normal form. 3/1776 useless extension candidates. Maximal degree in co-relation 2585. Up to 232 conditions per place. [2025-03-08 22:02:56,855 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 34 selfloop transitions, 30 changer transitions 0/437 dead transitions. [2025-03-08 22:02:56,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 437 transitions, 1648 flow [2025-03-08 22:02:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 22:02:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 22:02:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8797 transitions. [2025-03-08 22:02:56,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.847495183044316 [2025-03-08 22:02:56,869 INFO L175 Difference]: Start difference. First operand has 362 places, 420 transitions, 1392 flow. Second operand 30 states and 8797 transitions. [2025-03-08 22:02:56,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 437 transitions, 1648 flow [2025-03-08 22:02:56,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 437 transitions, 1618 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-03-08 22:02:56,881 INFO L231 Difference]: Finished difference. Result has 389 places, 430 transitions, 1520 flow [2025-03-08 22:02:56,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1368, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1520, PETRI_PLACES=389, PETRI_TRANSITIONS=430} [2025-03-08 22:02:56,883 INFO L279 CegarLoopForPetriNet]: 319 programPoint places, 70 predicate places. [2025-03-08 22:02:56,883 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 430 transitions, 1520 flow [2025-03-08 22:02:56,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 293.04347826086956) internal successors, (6740), 23 states have internal predecessors, (6740), 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-08 22:02:56,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:56,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:56,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:02:57,086 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-08 22:02:57,087 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-08 22:02:57,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:57,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1040237810, now seen corresponding path program 3 times [2025-03-08 22:02:57,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:57,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128098137] [2025-03-08 22:02:57,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 22:02:57,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:57,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 167 statements into 11 equivalence classes. [2025-03-08 22:02:57,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:02:57,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 22:02:57,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:57,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:02:57,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 22:02:57,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 22:02:57,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:57,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:02:57,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:02:57,201 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:02:57,202 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-08 22:02:57,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2025-03-08 22:02:57,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2025-03-08 22:02:57,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2025-03-08 22:02:57,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2025-03-08 22:02:57,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2025-03-08 22:02:57,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2025-03-08 22:02:57,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2025-03-08 22:02:57,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2025-03-08 22:02:57,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2025-03-08 22:02:57,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2025-03-08 22:02:57,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2025-03-08 22:02:57,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2025-03-08 22:02:57,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2025-03-08 22:02:57,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2025-03-08 22:02:57,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2025-03-08 22:02:57,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2025-03-08 22:02:57,208 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2025-03-08 22:02:57,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:02:57,209 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-03-08 22:02:57,211 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:02:57,211 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:02:57,260 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:02:57,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 420 places, 460 transitions, 936 flow [2025-03-08 22:02:57,332 INFO L124 PetriNetUnfolderBase]: 72/739 cut-off events. [2025-03-08 22:02:57,333 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-08 22:02:57,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 739 events. 72/739 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3357 event pairs, 0 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 474. Up to 12 conditions per place. [2025-03-08 22:02:57,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 420 places, 460 transitions, 936 flow [2025-03-08 22:02:57,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 460 transitions, 936 flow [2025-03-08 22:02:57,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:02:57,348 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;@7d032086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:02:57,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-08 22:02:57,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:02:57,354 INFO L124 PetriNetUnfolderBase]: 5/132 cut-off events. [2025-03-08 22:02:57,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:02:57,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:57,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:57,355 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-08 22:02:57,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:57,355 INFO L85 PathProgramCache]: Analyzing trace with hash 313517334, now seen corresponding path program 1 times [2025-03-08 22:02:57,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:57,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367713093] [2025-03-08 22:02:57,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:57,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 22:02:57,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 22:02:57,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:57,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:57,410 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-08 22:02:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:57,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367713093] [2025-03-08 22:02:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367713093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:02:57,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:02:57,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:02:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985576037] [2025-03-08 22:02:57,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:02:57,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:02:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:57,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:02:57,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:02:57,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 460 [2025-03-08 22:02:57,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 460 transitions, 936 flow. Second operand has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-08 22:02:57,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:57,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 460 [2025-03-08 22:02:57,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:02:58,788 INFO L124 PetriNetUnfolderBase]: 1580/11522 cut-off events. [2025-03-08 22:02:58,788 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-08 22:02:58,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13983 conditions, 11522 events. 1580/11522 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 137390 event pairs, 1464 based on Foata normal form. 2452/13071 useless extension candidates. Maximal degree in co-relation 12345. Up to 2408 conditions per place. [2025-03-08 22:02:58,860 INFO L140 encePairwiseOnDemand]: 418/460 looper letters, 33 selfloop transitions, 2 changer transitions 1/416 dead transitions. [2025-03-08 22:02:58,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 416 transitions, 918 flow [2025-03-08 22:02:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:02:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:02:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1227 transitions. [2025-03-08 22:02:58,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8891304347826087 [2025-03-08 22:02:58,864 INFO L175 Difference]: Start difference. First operand has 420 places, 460 transitions, 936 flow. Second operand 3 states and 1227 transitions. [2025-03-08 22:02:58,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 416 transitions, 918 flow [2025-03-08 22:02:58,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 416 transitions, 918 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:02:58,869 INFO L231 Difference]: Finished difference. Result has 417 places, 415 transitions, 856 flow [2025-03-08 22:02:58,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=417, PETRI_TRANSITIONS=415} [2025-03-08 22:02:58,871 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -3 predicate places. [2025-03-08 22:02:58,871 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 415 transitions, 856 flow [2025-03-08 22:02:58,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 385.3333333333333) internal successors, (1156), 3 states have internal predecessors, (1156), 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-08 22:02:58,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:02:58,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:02:58,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:02:58,872 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-08 22:02:58,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:02:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -437195578, now seen corresponding path program 1 times [2025-03-08 22:02:58,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:02:58,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-03-08 22:02:58,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:02:58,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:58,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:58,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:58,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:58,932 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-08 22:02:58,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:02:58,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115613713] [2025-03-08 22:02:58,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115613713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:02:58,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548663444] [2025-03-08 22:02:58,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:02:58,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:02:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:02:58,934 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-08 22:02:58,936 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-08 22:02:58,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 22:02:59,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 22:02:59,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:02:59,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:02:59,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:02:59,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:02:59,030 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-08 22:02:59,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:02:59,054 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-08 22:02:59,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548663444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:02:59,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:02:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 22:02:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472857482] [2025-03-08 22:02:59,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:02:59,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:02:59,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:02:59,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:02:59,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:02:59,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 381 out of 460 [2025-03-08 22:02:59,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 415 transitions, 856 flow. Second operand has 10 states, 10 states have (on average 382.8) internal successors, (3828), 10 states have internal predecessors, (3828), 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-08 22:02:59,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:02:59,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 381 of 460 [2025-03-08 22:02:59,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:00,307 INFO L124 PetriNetUnfolderBase]: 1580/11528 cut-off events. [2025-03-08 22:03:00,307 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-03-08 22:03:00,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14008 conditions, 11528 events. 1580/11528 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 137420 event pairs, 1464 based on Foata normal form. 2/10628 useless extension candidates. Maximal degree in co-relation 13912. Up to 2408 conditions per place. [2025-03-08 22:03:00,357 INFO L140 encePairwiseOnDemand]: 454/460 looper letters, 37 selfloop transitions, 9 changer transitions 0/423 dead transitions. [2025-03-08 22:03:00,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 423 transitions, 966 flow [2025-03-08 22:03:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:03:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:03:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3477 transitions. [2025-03-08 22:03:00,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8398550724637681 [2025-03-08 22:03:00,362 INFO L175 Difference]: Start difference. First operand has 417 places, 415 transitions, 856 flow. Second operand 9 states and 3477 transitions. [2025-03-08 22:03:00,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 423 transitions, 966 flow [2025-03-08 22:03:00,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 423 transitions, 964 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:00,367 INFO L231 Difference]: Finished difference. Result has 426 places, 421 transitions, 904 flow [2025-03-08 22:03:00,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=904, PETRI_PLACES=426, PETRI_TRANSITIONS=421} [2025-03-08 22:03:00,368 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 6 predicate places. [2025-03-08 22:03:00,368 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 421 transitions, 904 flow [2025-03-08 22:03:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 382.8) internal successors, (3828), 10 states have internal predecessors, (3828), 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-08 22:03:00,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:00,369 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:00,375 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-08 22:03:00,574 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-08 22:03:00,574 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-08 22:03:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 632315590, now seen corresponding path program 2 times [2025-03-08 22:03:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:00,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55734133] [2025-03-08 22:03:00,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:03:00,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:00,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-08 22:03:00,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 117 statements. [2025-03-08 22:03:00,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:03:00,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:00,789 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-08 22:03:00,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:00,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55734133] [2025-03-08 22:03:00,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55734133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:00,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:00,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:00,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604444635] [2025-03-08 22:03:00,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:00,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:00,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:00,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:00,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:01,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 460 [2025-03-08 22:03:01,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 421 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 313.5) internal successors, (1881), 6 states have internal predecessors, (1881), 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-08 22:03:01,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:01,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 460 [2025-03-08 22:03:01,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:22,733 INFO L124 PetriNetUnfolderBase]: 83047/199695 cut-off events. [2025-03-08 22:03:22,733 INFO L125 PetriNetUnfolderBase]: For 1022/1035 co-relation queries the response was YES. [2025-03-08 22:03:23,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324672 conditions, 199695 events. 83047/199695 cut-off events. For 1022/1035 co-relation queries the response was YES. Maximal size of possible extension queue 3776. Compared 2674812 event pairs, 64070 based on Foata normal form. 0/185557 useless extension candidates. Maximal degree in co-relation 324547. Up to 116849 conditions per place. [2025-03-08 22:03:24,120 INFO L140 encePairwiseOnDemand]: 413/460 looper letters, 170 selfloop transitions, 166 changer transitions 0/651 dead transitions. [2025-03-08 22:03:24,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 651 transitions, 2041 flow [2025-03-08 22:03:24,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:24,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2209 transitions. [2025-03-08 22:03:24,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8003623188405797 [2025-03-08 22:03:24,124 INFO L175 Difference]: Start difference. First operand has 426 places, 421 transitions, 904 flow. Second operand 6 states and 2209 transitions. [2025-03-08 22:03:24,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 651 transitions, 2041 flow [2025-03-08 22:03:24,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 651 transitions, 2035 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:24,172 INFO L231 Difference]: Finished difference. Result has 435 places, 586 transitions, 1984 flow [2025-03-08 22:03:24,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1984, PETRI_PLACES=435, PETRI_TRANSITIONS=586} [2025-03-08 22:03:24,173 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 15 predicate places. [2025-03-08 22:03:24,174 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 586 transitions, 1984 flow [2025-03-08 22:03:24,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 313.5) internal successors, (1881), 6 states have internal predecessors, (1881), 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-08 22:03:24,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:24,175 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:24,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:03:24,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:03:24,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1935217751, now seen corresponding path program 1 times [2025-03-08 22:03:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860984112] [2025-03-08 22:03:24,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:24,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 22:03:24,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 22:03:24,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:24,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:24,222 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-08 22:03:24,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:24,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860984112] [2025-03-08 22:03:24,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860984112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:24,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:24,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:24,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930185428] [2025-03-08 22:03:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:24,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:24,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:24,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:24,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:24,238 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 460 [2025-03-08 22:03:24,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 586 transitions, 1984 flow. Second operand has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-08 22:03:24,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:24,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 460 [2025-03-08 22:03:24,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:30,579 INFO L124 PetriNetUnfolderBase]: 14862/56795 cut-off events. [2025-03-08 22:03:30,579 INFO L125 PetriNetUnfolderBase]: For 6524/7109 co-relation queries the response was YES. [2025-03-08 22:03:30,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91530 conditions, 56795 events. 14862/56795 cut-off events. For 6524/7109 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 766901 event pairs, 6640 based on Foata normal form. 1/51980 useless extension candidates. Maximal degree in co-relation 91403. Up to 13356 conditions per place. [2025-03-08 22:03:30,985 INFO L140 encePairwiseOnDemand]: 457/460 looper letters, 42 selfloop transitions, 3 changer transitions 0/596 dead transitions. [2025-03-08 22:03:30,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 596 transitions, 2100 flow [2025-03-08 22:03:30,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:30,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1196 transitions. [2025-03-08 22:03:30,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-08 22:03:30,988 INFO L175 Difference]: Start difference. First operand has 435 places, 586 transitions, 1984 flow. Second operand 3 states and 1196 transitions. [2025-03-08 22:03:30,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 596 transitions, 2100 flow [2025-03-08 22:03:31,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 596 transitions, 2100 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:03:31,069 INFO L231 Difference]: Finished difference. Result has 438 places, 588 transitions, 2009 flow [2025-03-08 22:03:31,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=460, PETRI_DIFFERENCE_MINUEND_FLOW=1984, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2009, PETRI_PLACES=438, PETRI_TRANSITIONS=588} [2025-03-08 22:03:31,070 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 18 predicate places. [2025-03-08 22:03:31,070 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 588 transitions, 2009 flow [2025-03-08 22:03:31,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 386.0) internal successors, (1158), 3 states have internal predecessors, (1158), 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-08 22:03:31,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:31,071 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:31,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:03:31,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-03-08 22:03:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1250807031, now seen corresponding path program 1 times [2025-03-08 22:03:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:31,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226670511] [2025-03-08 22:03:31,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:31,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 22:03:31,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 22:03:31,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:31,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:31,146 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-08 22:03:31,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226670511] [2025-03-08 22:03:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226670511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:31,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:31,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:31,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783536966] [2025-03-08 22:03:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:31,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:03:31,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:31,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:03:31,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:03:31,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 460 [2025-03-08 22:03:31,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 588 transitions, 2009 flow. Second operand has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 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-08 22:03:31,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:31,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 460 [2025-03-08 22:03:31,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand