/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:52:49,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:52:49,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:52:49,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:52:49,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:52:49,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:52:49,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:52:49,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:52:49,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:52:49,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:52:49,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:52:49,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:52:49,618 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:52:49,618 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:52:49,618 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:52:49,618 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:52:49,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:52:49,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:52:49,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:49,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:52:49,620 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:52:49,621 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:52:49,621 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:52:49,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:52:49,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:52:49,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:52:49,850 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:52:49,850 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:52:49,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl [2025-04-26 16:52:49,854 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/bigNumberOfThreads.bpl' [2025-04-26 16:52:49,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:52:49,868 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:52:49,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:49,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:52:49,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:52:49,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,902 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:52:49,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:49,904 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:52:49,904 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:52:49,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:52:49,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:52:49,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:52:49,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:52:49,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:52:49,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/1) ... [2025-04-26 16:52:49,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:49,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:49,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:52:49,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:52:49,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:52:49,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:52:49,967 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread given in one single declaration [2025-04-26 16:52:49,967 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-26 16:52:49,967 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-26 16:52:49,968 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:52:50,001 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:52:50,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:52:50,056 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:52:50,056 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:52:50,062 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:52:50,063 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:52:50,063 INFO L201 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:50 BoogieIcfgContainer [2025-04-26 16:52:50,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:52:50,064 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:52:50,064 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:52:50,068 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:52:50,068 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:50,068 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:49" (1/2) ... [2025-04-26 16:52:50,069 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b16fdb2 and model type bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:52:50, skipping insertion in model container [2025-04-26 16:52:50,070 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:50,070 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:50" (2/2) ... [2025-04-26 16:52:50,071 INFO L376 chiAutomizerObserver]: Analyzing ICFG bigNumberOfThreads.bpl [2025-04-26 16:52:50,101 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:50,144 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:50,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:50,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:50,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:50,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:52:50,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 30 flow [2025-04-26 16:52:50,226 INFO L116 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-04-26 16:52:50,229 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 16:52:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 18 events. 1/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 8. Up to 2 conditions per place. [2025-04-26 16:52:50,233 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 13 transitions, 30 flow [2025-04-26 16:52:50,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 30 flow [2025-04-26 16:52:50,237 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 15 places, 13 transitions, 30 flow [2025-04-26 16:52:50,241 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:50,278 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 72#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 16:52:50,278 WARN L140 AmpleReduction]: Number of pruned transitions: 8 [2025-04-26 16:52:50,278 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:50,278 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:50,278 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:13 [2025-04-26 16:52:50,278 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:8 [2025-04-26 16:52:50,279 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:50,279 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:50,279 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:50,281 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (in total 24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,286 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:50,286 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:50,286 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:50,286 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:50,287 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:50,287 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:50,287 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:50,287 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:50,288 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (in total 24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:50,298 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:50,298 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:50,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:50,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:50,301 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:50,301 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (in total 24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:50,302 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:50,302 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:50,302 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:50,302 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:50,306 INFO L752 eck$LassoCheckResult]: Stem: "[20] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[17] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[22] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[30] L30-->$Ultimate##0: Formula: (= v_threadThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_i_7) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_7} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_7, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of1ForFork0_thidvar0]" "[15] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[22] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[28] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[26] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 16:52:50,306 INFO L754 eck$LassoCheckResult]: Loop: "[29] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:50,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1549690411, now seen corresponding path program 1 times [2025-04-26 16:52:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728508403] [2025-04-26 16:52:50,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:50,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:50,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:50,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash 60, now seen corresponding path program 1 times [2025-04-26 16:52:50,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823026523] [2025-04-26 16:52:50,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:50,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:50,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:50,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:50,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 795762514, now seen corresponding path program 1 times [2025-04-26 16:52:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240580035] [2025-04-26 16:52:50,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:50,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:50,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:52:50,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:52:50,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:50,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:50,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:50,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:50,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,523 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:50,528 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:50,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:52:50,563 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:50,565 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:50,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 16:52:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:50,589 INFO L116 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-04-26 16:52:50,589 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:52:50,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 27 events. 1/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-04-26 16:52:50,589 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:50,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:50,590 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 16 transitions, 42 flow [2025-04-26 16:52:50,590 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:50,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 171#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 16:52:50,634 WARN L140 AmpleReduction]: Number of pruned transitions: 40 [2025-04-26 16:52:50,634 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:50,634 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:50,634 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:24 [2025-04-26 16:52:50,634 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:27 [2025-04-26 16:52:50,634 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:50,634 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:50,634 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:50,635 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 52 states, 46 states have (on average 1.3478260869565217) internal successors, (in total 62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,635 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:50,635 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:50,635 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:50,635 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:50,635 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:50,635 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:50,635 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:50,635 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:50,636 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 46 states have (on average 1.3478260869565217) internal successors, (in total 62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:50,642 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:50,642 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:50,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:50,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:50,643 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:50,643 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 states, 46 states have (on average 1.3478260869565217) internal successors, (in total 62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:50,648 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:50,648 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:50,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:50,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:50,649 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[39] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[54] L30-->$Ultimate##0: Formula: (= v_threadThread1of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_11) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_11} OutVars{threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_11} AuxVars[] AssignedVars[threadThread1of2ForFork0_thidvar0]" "[37] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[55] L30-->$Ultimate##0: Formula: (= v_threadThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_i_13) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_13} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_13, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of2ForFork0_thidvar0]" "[37] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[44] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[52] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[48] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[50] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 16:52:50,649 INFO L754 eck$LassoCheckResult]: Loop: "[53] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:50,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1633377337, now seen corresponding path program 1 times [2025-04-26 16:52:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264494538] [2025-04-26 16:52:50,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:50,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:50,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:50,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:50,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash 84, now seen corresponding path program 1 times [2025-04-26 16:52:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102943254] [2025-04-26 16:52:50,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:50,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:50,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:50,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:50,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,676 INFO L85 PathProgramCache]: Analyzing trace with hash 904910158, now seen corresponding path program 1 times [2025-04-26 16:52:50,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291365671] [2025-04-26 16:52:50,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:50,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:50,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:50,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:50,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:50,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:50,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:52:50,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:52:50,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,787 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:50,792 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:50,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:50,803 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:50,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:50,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:50,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:50,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2025-04-26 16:52:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 19 transitions, 56 flow [2025-04-26 16:52:50,830 INFO L116 PetriNetUnfolderBase]: 1/36 cut-off events. [2025-04-26 16:52:50,830 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 16:52:50,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 1/36 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2025-04-26 16:52:50,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 19 transitions, 56 flow [2025-04-26 16:52:50,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 19 transitions, 56 flow [2025-04-26 16:52:50,831 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 25 places, 19 transitions, 56 flow [2025-04-26 16:52:50,831 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:50,926 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 406#[threadFINAL, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 16:52:50,931 WARN L140 AmpleReduction]: Number of pruned transitions: 146 [2025-04-26 16:52:50,931 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:50,931 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:50,931 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:42 [2025-04-26 16:52:50,931 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:79 [2025-04-26 16:52:50,931 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:50,931 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:50,931 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:50,931 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 122 states, 114 states have (on average 1.3421052631578947) internal successors, (in total 153), 121 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,932 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:50,932 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:50,932 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:50,932 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:50,932 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:50,932 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:50,932 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:50,932 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:50,932 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 114 states have (on average 1.3421052631578947) internal successors, (in total 153), 121 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:50,935 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:50,935 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:50,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:50,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:50,936 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:50,936 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 122 states, 114 states have (on average 1.3421052631578947) internal successors, (in total 153), 121 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:50,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:50,940 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:50,940 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:50,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:50,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:50,941 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[74] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[91] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_18 v_threadThread1of3ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_18} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_18, threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of3ForFork0_thidvar0]" "[72] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[92] L30-->$Ultimate##0: Formula: (= v_threadThread2of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_20) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_20} OutVars{threadThread2of3ForFork0_thidvar0=v_threadThread2of3ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_20} AuxVars[] AssignedVars[threadThread2of3ForFork0_thidvar0]" "[72] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[93] L30-->$Ultimate##0: Formula: (= v_threadThread3of3ForFork0_thidvar0_2 v_ULTIMATE.start_i_22) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_22} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_22, threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of3ForFork0_thidvar0]" "[72] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[79] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[89] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[83] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[85] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[87] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 16:52:50,941 INFO L754 eck$LassoCheckResult]: Loop: "[90] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:50,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash -22501202, now seen corresponding path program 1 times [2025-04-26 16:52:50,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593230478] [2025-04-26 16:52:50,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:50,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:50,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:50,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:50,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,966 INFO L85 PathProgramCache]: Analyzing trace with hash 121, now seen corresponding path program 1 times [2025-04-26 16:52:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,966 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099703645] [2025-04-26 16:52:50,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:50,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:50,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,968 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:50,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:50,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:50,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:50,970 INFO L85 PathProgramCache]: Analyzing trace with hash -697537172, now seen corresponding path program 1 times [2025-04-26 16:52:50,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:50,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674545159] [2025-04-26 16:52:50,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:50,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:50,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:52:50,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:52:50,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:50,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:52:50,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:52:50,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:50,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:50,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:51,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:51,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:51,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,091 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:51,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:52:51,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:52:51,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,101 WARN L166 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:51,106 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:51,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:51,115 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:51,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:51,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:51,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:51,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2025-04-26 16:52:51,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 72 flow [2025-04-26 16:52:51,137 INFO L116 PetriNetUnfolderBase]: 1/45 cut-off events. [2025-04-26 16:52:51,138 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-26 16:52:51,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 45 events. 1/45 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2025-04-26 16:52:51,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 22 transitions, 72 flow [2025-04-26 16:52:51,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 22 transitions, 72 flow [2025-04-26 16:52:51,139 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 22 transitions, 72 flow [2025-04-26 16:52:51,139 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:51,323 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 981#[threadFINAL, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL, threadFINAL]true [2025-04-26 16:52:51,324 WARN L140 AmpleReduction]: Number of pruned transitions: 468 [2025-04-26 16:52:51,324 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:51,324 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:51,324 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:71 [2025-04-26 16:52:51,324 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:212 [2025-04-26 16:52:51,324 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:51,324 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:51,324 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:51,325 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 284 states, 274 states have (on average 1.332116788321168) internal successors, (in total 365), 283 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:51,326 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:51,326 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:51,327 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:51,327 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:51,327 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:51,327 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:51,327 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:51,327 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:51,327 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 284 states, 274 states have (on average 1.332116788321168) internal successors, (in total 365), 283 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:51,335 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:51,335 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:51,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:51,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:51,335 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:51,336 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 284 states, 274 states have (on average 1.332116788321168) internal successors, (in total 365), 283 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:51,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:51,342 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:51,342 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:51,343 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:51,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:51,347 INFO L752 eck$LassoCheckResult]: Stem: "[129] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[126] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[145] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_28 v_threadThread1of4ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_28} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_28, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[146] L30-->$Ultimate##0: Formula: (= v_threadThread2of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_30) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_30} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_30, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[147] L30-->$Ultimate##0: Formula: (= v_threadThread3of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_32) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_32} OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_32} AuxVars[] AssignedVars[threadThread3of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[148] L30-->$Ultimate##0: Formula: (= v_threadThread4of4ForFork0_thidvar0_2 v_ULTIMATE.start_i_34) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_34} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_34, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread4of4ForFork0_thidvar0]" "[124] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[131] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[143] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[137] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[139] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[135] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 16:52:51,347 INFO L754 eck$LassoCheckResult]: Loop: "[144] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:51,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash 317927168, now seen corresponding path program 1 times [2025-04-26 16:52:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:51,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068226111] [2025-04-26 16:52:51,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:51,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:52:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:52:51,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:51,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:52:51,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:52:51,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:51,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:51,372 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2025-04-26 16:52:51,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:51,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239145411] [2025-04-26 16:52:51,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:51,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:51,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:51,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:51,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:51,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:51,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:51,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1265807760, now seen corresponding path program 1 times [2025-04-26 16:52:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:51,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294882237] [2025-04-26 16:52:51,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:51,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:52:51,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:52:51,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:51,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:52:51,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:52:51,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:51,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:52:51,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:52:51,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:51,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:52:51,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:52:51,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,528 WARN L166 chiAutomizerObserver]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:52:51,533 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:52:51,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2025-04-26 16:52:51,545 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:51,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:51,550 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:51,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2025-04-26 16:52:51,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 90 flow [2025-04-26 16:52:51,575 INFO L116 PetriNetUnfolderBase]: 1/54 cut-off events. [2025-04-26 16:52:51,575 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-26 16:52:51,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 54 events. 1/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2025-04-26 16:52:51,576 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 90 flow [2025-04-26 16:52:51,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 25 transitions, 90 flow [2025-04-26 16:52:51,577 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 25 transitions, 90 flow [2025-04-26 16:52:51,577 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:51,744 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2450#[threadFINAL, threadFINAL, threadFINAL, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 16:52:51,744 WARN L140 AmpleReduction]: Number of pruned transitions: 1386 [2025-04-26 16:52:51,744 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:52:51,744 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:52:51,744 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:119 [2025-04-26 16:52:51,744 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:534 [2025-04-26 16:52:51,744 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:52:51,744 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:52:51,744 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:51,745 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:51,746 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:51,746 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:51,746 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:51,746 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:51,746 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:51,746 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:51,746 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:51,746 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:51,747 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:51,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:51,753 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:51,753 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:51,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:51,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:51,756 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:51,757 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:51,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 16:52:51,768 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:51,768 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:51,768 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:51,768 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:52:51,769 INFO L752 eck$LassoCheckResult]: Stem: "[202] $Ultimate##0-->L27: Formula: (= v_x_1 0) InVars {} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[199] L27-->L29-1: Formula: (= 0 v_ULTIMATE.start_i_1) InVars {} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_1} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[220] L30-->$Ultimate##0: Formula: (= v_threadThread1of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_41) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_41} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_41, threadThread1of5ForFork0_thidvar0=v_threadThread1of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread1of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[221] L30-->$Ultimate##0: Formula: (= v_threadThread2of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_43) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_43} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_43, threadThread2of5ForFork0_thidvar0=v_threadThread2of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread2of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[222] L30-->$Ultimate##0: Formula: (= v_threadThread3of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_45) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_45} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_45, threadThread3of5ForFork0_thidvar0=v_threadThread3of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread3of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[223] L30-->$Ultimate##0: Formula: (= v_threadThread4of5ForFork0_thidvar0_2 v_ULTIMATE.start_i_47) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_47} OutVars{threadThread4of5ForFork0_thidvar0=v_threadThread4of5ForFork0_thidvar0_2, ULTIMATE.start_i=v_ULTIMATE.start_i_47} AuxVars[] AssignedVars[threadThread4of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[224] L30-->$Ultimate##0: Formula: (= v_ULTIMATE.start_i_49 v_threadThread5of5ForFork0_thidvar0_2) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_49} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_49, threadThread5of5ForFork0_thidvar0=v_threadThread5of5ForFork0_thidvar0_2} AuxVars[] AssignedVars[threadThread5of5ForFork0_thidvar0]" "[197] L30-1-->L29-1: Formula: (= (+ 1 v_ULTIMATE.start_i_4) v_ULTIMATE.start_i_3) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_4} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_3} AuxVars[] AssignedVars[ULTIMATE.start_i]" "[204] L29-1-->L30: Formula: (< v_ULTIMATE.start_i_2 5) InVars {ULTIMATE.start_i=v_ULTIMATE.start_i_2} OutVars{ULTIMATE.start_i=v_ULTIMATE.start_i_2} AuxVars[] AssignedVars[]" "[218] L30-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[214] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[216] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[212] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[210] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[208] $Ultimate##0-->threadFINAL: Formula: (= (+ v_x_5 1) v_x_4) InVars {x=v_x_5} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" [2025-04-26 16:52:51,769 INFO L754 eck$LassoCheckResult]: Loop: "[219] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:52:51,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash -895667859, now seen corresponding path program 1 times [2025-04-26 16:52:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:51,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614442802] [2025-04-26 16:52:51,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:51,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:52:51,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:52:51,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:52:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:51,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614442802] [2025-04-26 16:52:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614442802] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-26 16:52:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816818998] [2025-04-26 16:52:51,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:51,937 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:52:51,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:51,937 INFO L85 PathProgramCache]: Analyzing trace with hash 250, now seen corresponding path program 1 times [2025-04-26 16:52:51,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:51,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152290111] [2025-04-26 16:52:51,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:51,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:51,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:51,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:51,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:51,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:52:51,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:52:51,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:51,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:51,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:51,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:52:51,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:52:51,962 INFO L87 Difference]: Start difference. First operand has 654 states, 642 states have (on average 1.32398753894081) internal successors, (in total 850), 653 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 8 states, 8 states have (on average 3.0) internal successors, (in total 24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:52:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:52,025 INFO L93 Difference]: Finished difference Result 647 states and 842 transitions. [2025-04-26 16:52:52,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 647 states and 842 transitions. [2025-04-26 16:52:52,035 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:52,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 647 states to 0 states and 0 transitions. [2025-04-26 16:52:52,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:52:52,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:52:52,041 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:52:52,041 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:52,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:52,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:52,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:52:52,044 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:52,045 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:52,045 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:52:52,045 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:52,045 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:52:52,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Ended with exit code 0 [2025-04-26 16:52:52,056 INFO L201 PluginConnector]: Adding new model bigNumberOfThreads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:52:52 BoogieIcfgContainer [2025-04-26 16:52:52,056 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:52:52,056 INFO L158 Benchmark]: Toolchain (without parser) took 2188.21ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 82.8MB in the beginning and 86.2MB in the end (delta: -3.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:52,057 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.85ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:52,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.37ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 80.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:52,057 INFO L158 Benchmark]: Boogie Preprocessor took 17.59ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 918.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:52:52,057 INFO L158 Benchmark]: RCFGBuilder took 137.34ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 71.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:52:52,057 INFO L158 Benchmark]: BuchiAutomizer took 1991.95ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.5MB in the beginning and 86.2MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:52,058 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.85ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.37ms. Allocated memory is still 155.2MB. Free memory was 82.8MB in the beginning and 80.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.59ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 918.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 137.34ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 71.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1991.95ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.5MB in the beginning and 86.2MB in the end (delta: -14.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 1 iterations. TraceHistogramMax:2. Analysis of lassos took 0.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 140, Number of transitions in reduction automaton: 24, Number of states in reduction automaton: 22, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.2s and 1 iterations. TraceHistogramMax:3. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 101, Number of transitions in reduction automaton: 62, Number of states in reduction automaton: 52, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 1 iterations. TraceHistogramMax:4. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 134, Number of transitions in reduction automaton: 153, Number of states in reduction automaton: 122, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.4s and 1 iterations. TraceHistogramMax:5. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 214, Number of transitions in reduction automaton: 365, Number of states in reduction automaton: 284, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.5s and 2 iterations. TraceHistogramMax:6. Analysis of lassos took 0.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 15 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 208, Number of transitions in reduction automaton: 850, Number of states in reduction automaton: 654, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 8 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:52:52,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...