/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/fork_in_loop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:38,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:38,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:38,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:38,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:38,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:38,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:38,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:38,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:38,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:38,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:38,308 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:38,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:38,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:38,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:38,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:38,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:38,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:38,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:38,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:38,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:38,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:38,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:38,311 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:38,311 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:38,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:38,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:38,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:38,538 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:38,539 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:38,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl [2025-04-26 18:38:38,541 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl' [2025-04-26 18:38:38,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:38,557 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:38,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:38,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:38,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:38,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,590 INFO L138 Inliner]: procedures = 2, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:38,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:38,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:38,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:38,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:38,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:38,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:38,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:38,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:38,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/1) ... [2025-04-26 18:38:38,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:38,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:38,638 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 18:38:38,640 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 18:38:38,656 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2025-04-26 18:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2025-04-26 18:38:38,656 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2025-04-26 18:38:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:38,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:38,657 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 18:38:38,685 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:38,687 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:38,736 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:38,736 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:38,742 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:38,742 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:38,744 INFO L201 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:38 BoogieIcfgContainer [2025-04-26 18:38:38,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:38,747 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:38,747 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:38,751 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:38,751 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:38,752 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:38" (1/2) ... [2025-04-26 18:38:38,752 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@af14657 and model type fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:38, skipping insertion in model container [2025-04-26 18:38:38,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:38,752 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:38" (2/2) ... [2025-04-26 18:38:38,754 INFO L376 chiAutomizerObserver]: Analyzing ICFG fork_in_loop.bpl [2025-04-26 18:38:38,791 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 18:38:38,831 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:38,833 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 18:38:38,834 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 18:38:38,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 80 flow [2025-04-26 18:38:38,891 INFO L116 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-04-26 18:38:38,893 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:38:38,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 18:38:38,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 27 transitions, 80 flow [2025-04-26 18:38:38,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 20 transitions, 54 flow [2025-04-26 18:38:38,900 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 23 places, 20 transitions, 54 flow [2025-04-26 18:38:38,901 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 20 transitions, 54 flow [2025-04-26 18:38:38,910 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (in total 65), 41 states have internal predecessors, (65), 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 18:38:38,911 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (in total 65), 41 states have internal predecessors, (65), 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 18:38:38,913 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:38,953 WARN L140 AmpleReduction]: Number of pruned transitions: 4 [2025-04-26 18:38:38,953 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:38:38,953 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 0 [2025-04-26 18:38:38,953 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 18:38:38,953 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:4 [2025-04-26 18:38:38,953 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:38,953 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:38,953 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:38,954 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 24 states, 21 states have (on average 1.1904761904761905) internal successors, (in total 25), 23 states have internal predecessors, (25), 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 18:38:38,958 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:38,958 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:38,959 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:38,959 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:38,959 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:38,959 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:38,959 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:38,959 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:38,960 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 21 states have (on average 1.1904761904761905) internal successors, (in total 25), 23 states have internal predecessors, (25), 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 18:38:38,967 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:38:38,967 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:38,967 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:38,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:38,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:38,970 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:38,970 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 21 states have (on average 1.1904761904761905) internal successors, (in total 25), 23 states have internal predecessors, (25), 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 18:38:38,971 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 18:38:38,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:38,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:38,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:38,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:38,974 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[53] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork1_thidvar0_2 v_ULTIMATE.start_x_16) (= v_fooThread1of1ForFork1_i_2 v_ULTIMATE.start_x_16)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_16} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_4, fooThread1of1ForFork1_i=v_fooThread1of1ForFork1_i_2, fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_16} AuxVars[] AssignedVars[fooThread1of1ForFork1_y, fooThread1of1ForFork1_i, fooThread1of1ForFork1_thidvar0]" "[44] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of1ForFork1_y_1 4) InVars {} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_1} AuxVars[] AssignedVars[fooThread1of1ForFork1_y]" "[45] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[35] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[51] L23-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:38,975 INFO L754 eck$LassoCheckResult]: Loop: "[52] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:38,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:38,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1567946904, now seen corresponding path program 1 times [2025-04-26 18:38:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:38,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816544647] [2025-04-26 18:38:38,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:38,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:38:39,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:38:39,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:39,100 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 18:38:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:39,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816544647] [2025-04-26 18:38:39,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816544647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:39,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:39,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593003486] [2025-04-26 18:38:39,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:39,111 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:39,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash 83, now seen corresponding path program 1 times [2025-04-26 18:38:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956787108] [2025-04-26 18:38:39,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:39,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:39,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:38:39,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:38:39,157 INFO L87 Difference]: Start difference. First operand has 24 states, 21 states have (on average 1.1904761904761905) internal successors, (in total 25), 23 states have internal predecessors, (25), 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 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 18:38:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:39,251 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2025-04-26 18:38:39,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 22 transitions. [2025-04-26 18:38:39,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:39,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 17 states and 17 transitions. [2025-04-26 18:38:39,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 18:38:39,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 18:38:39,261 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 17 transitions. [2025-04-26 18:38:39,261 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:39,262 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-04-26 18:38:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 17 transitions. [2025-04-26 18:38:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-26 18:38:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0) internal successors, (in total 17), 16 states have internal predecessors, (17), 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 18:38:39,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-04-26 18:38:39,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-04-26 18:38:39,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:38:39,312 INFO L438 stractBuchiCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-04-26 18:38:39,312 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:39,313 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 17 transitions. [2025-04-26 18:38:39,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:39,313 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:39,313 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:39,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:39,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:39,314 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[28] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[53] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork1_thidvar0_2 v_ULTIMATE.start_x_16) (= v_fooThread1of1ForFork1_i_2 v_ULTIMATE.start_x_16)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_16} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_4, fooThread1of1ForFork1_i=v_fooThread1of1ForFork1_i_2, fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_16} AuxVars[] AssignedVars[fooThread1of1ForFork1_y, fooThread1of1ForFork1_i, fooThread1of1ForFork1_thidvar0]" "[44] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of1ForFork1_y_1 4) InVars {} OutVars{fooThread1of1ForFork1_y=v_fooThread1of1ForFork1_y_1} AuxVars[] AssignedVars[fooThread1of1ForFork1_y]" "[45] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[35] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[27] L22-1-->L26: Formula: (<= 2 v_ULTIMATE.start_x_5) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_5} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_5} AuxVars[] AssignedVars[]" "[34] L26-->L27: Formula: (= 1 v_ULTIMATE.start_x_6) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[54] fooEXIT-->L28: Formula: (= v_fooThread1of1ForFork1_thidvar0_4 v_ULTIMATE.start_x_18) InVars {fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_4, ULTIMATE.start_x=v_ULTIMATE.start_x_18} OutVars{fooThread1of1ForFork1_thidvar0=v_fooThread1of1ForFork1_thidvar0_4, ULTIMATE.start_x=v_ULTIMATE.start_x_18} AuxVars[] AssignedVars[]" "[40] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[50] L29-->$Ultimate##0: Formula: (and (= v_fooThread1of1ForFork0_thidvar0_2 v_ULTIMATE.start_x_13) (= v_fooThread1of1ForFork0_i_2 v_ULTIMATE.start_x_13)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_13} OutVars{fooThread1of1ForFork0_thidvar0=v_fooThread1of1ForFork0_thidvar0_2, fooThread1of1ForFork0_y=v_fooThread1of1ForFork0_y_4, fooThread1of1ForFork0_i=v_fooThread1of1ForFork0_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_13} AuxVars[] AssignedVars[fooThread1of1ForFork0_thidvar0, fooThread1of1ForFork0_y, fooThread1of1ForFork0_i]" "[46] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of1ForFork0_y_1 4) InVars {} OutVars{fooThread1of1ForFork0_y=v_fooThread1of1ForFork0_y_1} AuxVars[] AssignedVars[fooThread1of1ForFork0_y]" "[47] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[32] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[40] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[48] L29-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:39,315 INFO L754 eck$LassoCheckResult]: Loop: "[49] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:39,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1238160273, now seen corresponding path program 1 times [2025-04-26 18:38:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663311880] [2025-04-26 18:38:39,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:39,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:39,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,332 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:39,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:39,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:39,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:39,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 80, now seen corresponding path program 1 times [2025-04-26 18:38:39,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385433606] [2025-04-26 18:38:39,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:39,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:39,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,374 INFO L85 PathProgramCache]: Analyzing trace with hash 271737250, now seen corresponding path program 1 times [2025-04-26 18:38:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891401036] [2025-04-26 18:38:39,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:39,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:38:39,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:38:39,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:39,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:39,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:39,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,523 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:38:39,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:38:39,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,543 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 18:38:39,554 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-04-26 18:38:39,566 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 18:38:39,567 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:39,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:39,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:39,569 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 18:38:39,571 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 18:38:39,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 39 transitions, 134 flow [2025-04-26 18:38:39,609 INFO L116 PetriNetUnfolderBase]: 18/115 cut-off events. [2025-04-26 18:38:39,610 INFO L117 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-04-26 18:38:39,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 115 events. 18/115 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 411 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 84. Up to 15 conditions per place. [2025-04-26 18:38:39,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 39 transitions, 134 flow [2025-04-26 18:38:39,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 37 transitions, 124 flow [2025-04-26 18:38:39,612 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 37 transitions, 124 flow [2025-04-26 18:38:39,612 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 37 transitions, 124 flow [2025-04-26 18:38:39,653 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 604 states, 591 states have (on average 2.6175972927241964) internal successors, (in total 1547), 603 states have internal predecessors, (1547), 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 18:38:39,654 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 604 states, 591 states have (on average 2.6175972927241964) internal successors, (in total 1547), 603 states have internal predecessors, (1547), 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 18:38:39,654 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:39,706 WARN L140 AmpleReduction]: Number of pruned transitions: 25 [2025-04-26 18:38:39,706 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:38:39,706 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 0 [2025-04-26 18:38:39,706 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:62 [2025-04-26 18:38:39,706 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:23 [2025-04-26 18:38:39,706 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:38:39,706 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:38:39,706 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:39,706 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 86 states, 77 states have (on average 1.2077922077922079) internal successors, (in total 93), 85 states have internal predecessors, (93), 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 18:38:39,706 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:39,706 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:39,707 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:39,707 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:39,707 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:39,707 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:39,707 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:39,707 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:39,707 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 86 states, 77 states have (on average 1.2077922077922079) internal successors, (in total 93), 85 states have internal predecessors, (93), 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 18:38:39,710 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:38:39,710 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:39,710 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:39,710 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:39,710 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:39,710 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:39,710 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 86 states, 77 states have (on average 1.2077922077922079) internal successors, (in total 93), 85 states have internal predecessors, (93), 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 18:38:39,712 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2025-04-26 18:38:39,712 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:39,712 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:39,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:39,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:39,715 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[74] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[104] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of2ForFork1_i_2 v_ULTIMATE.start_x_33) (= v_ULTIMATE.start_x_33 v_fooThread1of2ForFork1_thidvar0_2)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_33} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_4, fooThread1of2ForFork1_i=v_fooThread1of2ForFork1_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_33, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork1_y, fooThread1of2ForFork1_i, fooThread1of2ForFork1_thidvar0]" "[90] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of2ForFork1_y_1 4) InVars {} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_1} AuxVars[] AssignedVars[fooThread1of2ForFork1_y]" "[91] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[81] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[74] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[105] L23-->$Ultimate##0: Formula: (and (= v_fooThread2of2ForFork1_thidvar0_2 v_ULTIMATE.start_x_36) (= v_fooThread2of2ForFork1_i_2 v_ULTIMATE.start_x_36)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_36} OutVars{fooThread2of2ForFork1_thidvar0=v_fooThread2of2ForFork1_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_36, fooThread2of2ForFork1_y=v_fooThread2of2ForFork1_y_4, fooThread2of2ForFork1_i=v_fooThread2of2ForFork1_i_2} AuxVars[] AssignedVars[fooThread2of2ForFork1_thidvar0, fooThread2of2ForFork1_y, fooThread2of2ForFork1_i]" "[92] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread2of2ForFork1_y_1 4) InVars {} OutVars{fooThread2of2ForFork1_y=v_fooThread2of2ForFork1_y_1} AuxVars[] AssignedVars[fooThread2of2ForFork1_y]" "[93] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[81] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[74] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[102] L23-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:39,715 INFO L754 eck$LassoCheckResult]: Loop: "[103] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:39,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,716 INFO L85 PathProgramCache]: Analyzing trace with hash 503432305, now seen corresponding path program 1 times [2025-04-26 18:38:39,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707117710] [2025-04-26 18:38:39,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:38:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:38:39,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:39,761 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 18:38:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:39,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707117710] [2025-04-26 18:38:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707117710] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:39,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:38:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470944361] [2025-04-26 18:38:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:39,761 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:39,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,762 INFO L85 PathProgramCache]: Analyzing trace with hash 134, now seen corresponding path program 1 times [2025-04-26 18:38:39,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062616664] [2025-04-26 18:38:39,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:39,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:39,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:38:39,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:38:39,770 INFO L87 Difference]: Start difference. First operand has 86 states, 77 states have (on average 1.2077922077922079) internal successors, (in total 93), 85 states have internal predecessors, (93), 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 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 18:38:39,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:39,804 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2025-04-26 18:38:39,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 31 transitions. [2025-04-26 18:38:39,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:39,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 22 transitions. [2025-04-26 18:38:39,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-04-26 18:38:39,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-04-26 18:38:39,805 INFO L74 IsDeterministic]: Start isDeterministic. Operand 22 states and 22 transitions. [2025-04-26 18:38:39,805 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:39,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-04-26 18:38:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 22 transitions. [2025-04-26 18:38:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-26 18:38:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0) internal successors, (in total 22), 21 states have internal predecessors, (22), 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 18:38:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2025-04-26 18:38:39,806 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-04-26 18:38:39,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:38:39,807 INFO L438 stractBuchiCegarLoop]: Abstraction has 22 states and 22 transitions. [2025-04-26 18:38:39,807 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:39,807 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 22 transitions. [2025-04-26 18:38:39,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-04-26 18:38:39,808 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:39,808 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:39,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:39,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:38:39,809 INFO L752 eck$LassoCheckResult]: Stem: "[87] $Ultimate##0-->L22-1: Formula: (= 1 v_ULTIMATE.start_x_1) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_1} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[74] L22-1-->L23: Formula: (< v_ULTIMATE.start_x_2 2) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_2} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_2} AuxVars[] AssignedVars[]" "[104] L23-->$Ultimate##0: Formula: (and (= v_fooThread1of2ForFork1_i_2 v_ULTIMATE.start_x_33) (= v_ULTIMATE.start_x_33 v_fooThread1of2ForFork1_thidvar0_2)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_33} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_4, fooThread1of2ForFork1_i=v_fooThread1of2ForFork1_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_33, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork1_y, fooThread1of2ForFork1_i, fooThread1of2ForFork1_thidvar0]" "[90] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of2ForFork1_y_1 4) InVars {} OutVars{fooThread1of2ForFork1_y=v_fooThread1of2ForFork1_y_1} AuxVars[] AssignedVars[fooThread1of2ForFork1_y]" "[91] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[81] L23-1-->L22-1: Formula: (= (+ 1 v_ULTIMATE.start_x_4) v_ULTIMATE.start_x_3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_3} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[73] L22-1-->L26: Formula: (<= 2 v_ULTIMATE.start_x_5) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_5} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_5} AuxVars[] AssignedVars[]" "[80] L26-->L27: Formula: (= 1 v_ULTIMATE.start_x_6) InVars {} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_6} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[106] fooEXIT-->L28: Formula: (= v_ULTIMATE.start_x_38 v_fooThread1of2ForFork1_thidvar0_4) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_38, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_4} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_38, fooThread1of2ForFork1_thidvar0=v_fooThread1of2ForFork1_thidvar0_4} AuxVars[] AssignedVars[]" "[86] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[100] L29-->$Ultimate##0: Formula: (and (= v_ULTIMATE.start_x_27 v_fooThread1of2ForFork0_thidvar0_2) (= v_fooThread1of2ForFork0_i_2 v_ULTIMATE.start_x_27)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_27} OutVars{fooThread1of2ForFork0_y=v_fooThread1of2ForFork0_y_4, fooThread1of2ForFork0_i=v_fooThread1of2ForFork0_i_2, ULTIMATE.start_x=v_ULTIMATE.start_x_27, fooThread1of2ForFork0_thidvar0=v_fooThread1of2ForFork0_thidvar0_2} AuxVars[] AssignedVars[fooThread1of2ForFork0_y, fooThread1of2ForFork0_i, fooThread1of2ForFork0_thidvar0]" "[94] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread1of2ForFork0_y_1 4) InVars {} OutVars{fooThread1of2ForFork0_y=v_fooThread1of2ForFork0_y_1} AuxVars[] AssignedVars[fooThread1of2ForFork0_y]" "[95] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[78] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[86] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[101] L29-->$Ultimate##0: Formula: (and (= v_fooThread2of2ForFork0_thidvar0_2 v_ULTIMATE.start_x_30) (= v_fooThread2of2ForFork0_i_2 v_ULTIMATE.start_x_30)) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_30} OutVars{fooThread2of2ForFork0_thidvar0=v_fooThread2of2ForFork0_thidvar0_2, ULTIMATE.start_x=v_ULTIMATE.start_x_30, fooThread2of2ForFork0_y=v_fooThread2of2ForFork0_y_4, fooThread2of2ForFork0_i=v_fooThread2of2ForFork0_i_2} AuxVars[] AssignedVars[fooThread2of2ForFork0_thidvar0, fooThread2of2ForFork0_y, fooThread2of2ForFork0_i]" "[96] $Ultimate##0-->fooFINAL: Formula: (= v_fooThread2of2ForFork0_y_1 4) InVars {} OutVars{fooThread2of2ForFork0_y=v_fooThread2of2ForFork0_y_1} AuxVars[] AssignedVars[fooThread2of2ForFork0_y]" "[97] fooFINAL-->fooEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[78] L29-1-->L28: Formula: (= (+ 1 v_ULTIMATE.start_x_9) v_ULTIMATE.start_x_8) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_9} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_8} AuxVars[] AssignedVars[ULTIMATE.start_x]" "[86] L28-->L29: Formula: (< v_ULTIMATE.start_x_7 3) InVars {ULTIMATE.start_x=v_ULTIMATE.start_x_7} OutVars{ULTIMATE.start_x=v_ULTIMATE.start_x_7} AuxVars[] AssignedVars[]" "[98] L29-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:39,809 INFO L754 eck$LassoCheckResult]: Loop: "[99] ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:38:39,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash 60273234, now seen corresponding path program 1 times [2025-04-26 18:38:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716391554] [2025-04-26 18:38:39,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:38:39,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:38:39,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:39,873 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 18:38:39,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:39,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716391554] [2025-04-26 18:38:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716391554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:39,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:38:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166370894] [2025-04-26 18:38:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:39,874 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:38:39,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2025-04-26 18:38:39,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:39,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259178845] [2025-04-26 18:38:39,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:39,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:39,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,876 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:39,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:38:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:38:39,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:39,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:39,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:39,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:38:39,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:38:39,880 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. cyclomatic complexity: 1 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (in total 21), 5 states have internal predecessors, (21), 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 18:38:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:39,907 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2025-04-26 18:38:39,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 19 transitions. [2025-04-26 18:38:39,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:39,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2025-04-26 18:38:39,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:38:39,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:38:39,908 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:38:39,908 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:39,908 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:39,908 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:39,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:38:39,910 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:39,910 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:39,910 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:38:39,910 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:39,911 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:38:39,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2025-04-26 18:38:39,918 INFO L201 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:39 BoogieIcfgContainer [2025-04-26 18:38:39,918 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:39,919 INFO L158 Benchmark]: Toolchain (without parser) took 1361.83ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.2MB in the beginning and 72.1MB in the end (delta: 14.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2025-04-26 18:38:39,919 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.94ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 87.1MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:39,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.72ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:39,920 INFO L158 Benchmark]: Boogie Preprocessor took 19.21ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:39,920 INFO L158 Benchmark]: RCFGBuilder took 131.78ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:39,920 INFO L158 Benchmark]: BuchiAutomizer took 1171.70ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:39,924 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.94ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 87.1MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.72ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.21ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 83.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 131.78ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 74.4MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1171.70ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.0MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 0.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. 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, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 8 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 126, Number of transitions in reduction automaton: 25, Number of states in reduction automaton: 24, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.3s and 3 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 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. 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, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 19 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN2 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]: 146, Number of transitions in reduction automaton: 93, Number of states in reduction automaton: 86, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic). 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:38:39,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...