/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 /storage/cav23-termute-examples/4_plus_thr/indep_loops_4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:44,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:45,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:45,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:45,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:45,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:45,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:45,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:45,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:45,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:45,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:45,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:45,039 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:45,040 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:45,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:45,040 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:45,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:45,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:45,041 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:45,042 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:45,042 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:45,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:45,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:45,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:45,296 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:45,297 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:45,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_4.c.bpl [2025-04-26 18:42:45,300 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_4.c.bpl' [2025-04-26 18:42:45,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:45,313 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:45,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:45,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:45,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:45,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,353 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:45,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:45,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:45,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:45,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:45,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:45,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:45,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:45,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:45,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/1) ... [2025-04-26 18:42:45,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:45,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:45,413 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:42:45,420 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:42:45,438 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:45,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:45,439 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:45,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:45,439 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:45,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:45,439 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:45,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:45,439 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:42:45,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:42:45,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:42:45,440 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:42:45,477 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:45,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:45,563 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:45,564 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:45,577 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:45,577 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:45,577 INFO L201 PluginConnector]: Adding new model indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:45 BoogieIcfgContainer [2025-04-26 18:42:45,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:45,581 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:45,581 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:45,585 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:45,586 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:45,586 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:45" (1/2) ... [2025-04-26 18:42:45,587 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9604b97 and model type indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:45, skipping insertion in model container [2025-04-26 18:42:45,588 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:45,588 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:45" (2/2) ... [2025-04-26 18:42:45,589 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_4.c.bpl [2025-04-26 18:42:45,651 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:42:45,700 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:45,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:45,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:45,703 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:42:45,706 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:42:45,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 94 flow [2025-04-26 18:42:45,788 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-26 18:42:45,789 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:42:45,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 25 events. 4/25 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 53 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 18:42:45,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 94 flow [2025-04-26 18:42:45,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 25 transitions, 74 flow [2025-04-26 18:42:45,800 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 25 transitions, 74 flow [2025-04-26 18:42:45,800 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 74 flow [2025-04-26 18:42:45,860 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 427 states, 426 states have (on average 3.875586854460094) internal successors, (in total 1651), 426 states have internal predecessors, (1651), 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:42:45,861 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 427 states, 426 states have (on average 3.875586854460094) internal successors, (in total 1651), 426 states have internal predecessors, (1651), 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:42:45,863 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:45,972 WARN L140 AmpleReduction]: Number of pruned transitions: 543 [2025-04-26 18:42:45,972 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:45,972 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 186 [2025-04-26 18:42:45,972 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:21 [2025-04-26 18:42:45,972 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:219 [2025-04-26 18:42:45,972 WARN L145 AmpleReduction]: Times succ was already a loop node:370 [2025-04-26 18:42:45,972 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:18 [2025-04-26 18:42:45,972 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:45,974 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 427 states, 426 states have (on average 2.60093896713615) internal successors, (in total 1108), 426 states have internal predecessors, (1108), 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:42:45,980 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:45,980 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:45,980 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:45,980 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:45,980 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:45,980 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:45,980 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:45,980 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:45,982 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 427 states, 426 states have (on average 2.60093896713615) internal successors, (in total 1108), 426 states have internal predecessors, (1108), 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:42:46,007 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:42:46,008 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:46,008 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:46,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:46,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:46,013 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:46,014 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 427 states, 426 states have (on average 2.60093896713615) internal successors, (in total 1108), 426 states have internal predecessors, (1108), 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:42:46,029 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 18:42:46,029 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:46,029 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:46,030 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:46,030 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:46,034 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:46,035 INFO L754 eck$LassoCheckResult]: Loop: "[63] L25-->L27: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[65] L27-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:46,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 111, now seen corresponding path program 1 times [2025-04-26 18:42:46,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647962321] [2025-04-26 18:42:46,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:46,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:46,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:46,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 18:42:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109440754] [2025-04-26 18:42:46,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash 108689, now seen corresponding path program 1 times [2025-04-26 18:42:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249933269] [2025-04-26 18:42:46,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:46,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:46,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,154 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:46,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:46,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:46,217 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:46,217 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:46,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:46,217 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:46,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,218 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:46,218 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:46,218 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:46,218 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:46,218 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:46,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:46,273 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:46,273 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:46,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:46,289 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:46,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:46,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:46,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:46,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:46,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:46,386 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:46,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:46,391 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:46,391 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:46,391 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:46,391 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:46,391 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:46,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:46,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:46,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:46,391 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:46,391 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:46,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:46,422 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:46,425 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:46,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,428 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:46,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:46,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:46,443 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:46,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:46,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:46,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:46,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:46,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:46,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:46,455 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:46,455 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:46,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:46,478 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:46,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:46,481 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:46,481 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:46,482 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:46,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:46,490 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:46,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:46,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:46,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:46,522 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:46,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:46,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:46,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:46,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:46,548 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:42:46,563 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:46,565 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 427 states, 426 states have (on average 2.60093896713615) internal successors, (in total 1108), 426 states have internal predecessors, (1108), 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 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:42:46,692 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 427 states, 426 states have (on average 2.60093896713615) internal successors, (in total 1108), 426 states have internal predecessors, (1108), 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 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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) Result 1019 states and 2638 transitions. Complement of second has 6 states. [2025-04-26 18:42:46,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:46,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:42:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 18:42:46,699 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:46,700 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:46,700 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:46,700 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:46,700 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:46,700 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:46,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1019 states and 2638 transitions. [2025-04-26 18:42:46,711 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:42:46,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1019 states to 531 states and 1371 transitions. [2025-04-26 18:42:46,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 224 [2025-04-26 18:42:46,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 339 [2025-04-26 18:42:46,721 INFO L74 IsDeterministic]: Start isDeterministic. Operand 531 states and 1371 transitions. [2025-04-26 18:42:46,722 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:46,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 531 states and 1371 transitions. [2025-04-26 18:42:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states and 1371 transitions. [2025-04-26 18:42:46,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 456. [2025-04-26 18:42:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 456 states have (on average 2.5833333333333335) internal successors, (in total 1178), 455 states have internal predecessors, (1178), 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:42:46,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1178 transitions. [2025-04-26 18:42:46,763 INFO L240 hiAutomatonCegarLoop]: Abstraction has 456 states and 1178 transitions. [2025-04-26 18:42:46,764 INFO L438 stractBuchiCegarLoop]: Abstraction has 456 states and 1178 transitions. [2025-04-26 18:42:46,764 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:46,764 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 456 states and 1178 transitions. [2025-04-26 18:42:46,766 INFO L131 ngComponentsAnalysis]: Automaton has 75 accepting balls. 210 [2025-04-26 18:42:46,766 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:46,766 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:46,766 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:46,766 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:46,767 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[62] L25-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[64] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[83] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:46,767 INFO L754 eck$LassoCheckResult]: Loop: "[67] L34-->L36: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[69] L36-->L34: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:46,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 3368450, now seen corresponding path program 1 times [2025-04-26 18:42:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411586041] [2025-04-26 18:42:46,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:46,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:46,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:46,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:46,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash 3107, now seen corresponding path program 1 times [2025-04-26 18:42:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696386103] [2025-04-26 18:42:46,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:46,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:46,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,789 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1057884700, now seen corresponding path program 1 times [2025-04-26 18:42:46,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:46,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89260329] [2025-04-26 18:42:46,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:46,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:46,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:46,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:46,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,798 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:46,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:46,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:46,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:46,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:46,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:46,822 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:46,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:46,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:46,822 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:46,822 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:46,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:46,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:46,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:46,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:46,823 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:46,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:46,845 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:46,846 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:46,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:46,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:46,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:46,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:46,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,869 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:46,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:46,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:46,936 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:46,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:46,941 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:46,941 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:46,941 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:46,941 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:46,941 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:46,941 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,941 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:46,941 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:46,941 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:46,941 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:46,941 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:46,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:46,961 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:46,961 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:46,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,963 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:46,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:46,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:46,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:46,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:46,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:46,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:46,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:46,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:46,981 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:46,985 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:46,985 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:46,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:46,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:46,992 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:46,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:46,996 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:46,996 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:46,996 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:47,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:47,002 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:47,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:47,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:47,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,037 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,050 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:42:47,051 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:47,051 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 456 states and 1178 transitions. cyclomatic complexity: 829 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:42:47,115 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 456 states and 1178 transitions. cyclomatic complexity: 829. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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) Result 1204 states and 3132 transitions. Complement of second has 6 states. [2025-04-26 18:42:47,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:42:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 18:42:47,116 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:47,116 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,116 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:47,116 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,116 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:47,116 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1204 states and 3132 transitions. [2025-04-26 18:42:47,126 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:42:47,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1204 states to 679 states and 1722 transitions. [2025-04-26 18:42:47,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2025-04-26 18:42:47,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2025-04-26 18:42:47,133 INFO L74 IsDeterministic]: Start isDeterministic. Operand 679 states and 1722 transitions. [2025-04-26 18:42:47,134 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:47,134 INFO L218 hiAutomatonCegarLoop]: Abstraction has 679 states and 1722 transitions. [2025-04-26 18:42:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states and 1722 transitions. [2025-04-26 18:42:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 595. [2025-04-26 18:42:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 595 states have (on average 2.578151260504202) internal successors, (in total 1534), 594 states have internal predecessors, (1534), 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:42:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1534 transitions. [2025-04-26 18:42:47,159 INFO L240 hiAutomatonCegarLoop]: Abstraction has 595 states and 1534 transitions. [2025-04-26 18:42:47,159 INFO L438 stractBuchiCegarLoop]: Abstraction has 595 states and 1534 transitions. [2025-04-26 18:42:47,159 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:47,160 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 595 states and 1534 transitions. [2025-04-26 18:42:47,163 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 94 [2025-04-26 18:42:47,163 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:47,163 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:47,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:47,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:47,164 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[62] L25-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[64] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[83] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[66] L34-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[68] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[86] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:47,164 INFO L754 eck$LassoCheckResult]: Loop: "[71] L43-->L45: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[73] L45-->L43: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:47,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1565311762, now seen corresponding path program 1 times [2025-04-26 18:42:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113345195] [2025-04-26 18:42:47,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:47,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:47,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:47,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:47,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash 3235, now seen corresponding path program 1 times [2025-04-26 18:42:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878046469] [2025-04-26 18:42:47,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1026051956, now seen corresponding path program 1 times [2025-04-26 18:42:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191771896] [2025-04-26 18:42:47,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:47,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:47,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,195 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:47,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:47,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:47,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:47,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:47,217 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:47,217 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:47,217 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,217 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:47,217 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:47,217 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:47,217 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:47,217 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:47,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:47,234 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:47,234 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:47,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,236 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:47,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:47,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:47,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,258 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:47,260 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:47,260 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:47,327 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:47,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:47,332 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:47,332 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:47,332 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:47,332 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:47,332 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:47,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:47,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:47,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:47,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:47,332 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:47,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:47,353 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:47,353 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:47,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,355 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:47,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:47,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:47,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:47,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:47,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:47,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:47,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:47,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:47,372 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:47,374 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:47,374 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:47,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,376 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:47,379 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:47,381 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:47,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:47,383 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:47,383 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:47,383 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:47,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:47,390 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:47,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:47,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:47,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,457 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:42:47,458 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:47,458 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 595 states and 1534 transitions. cyclomatic complexity: 1039 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:42:47,535 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 595 states and 1534 transitions. cyclomatic complexity: 1039. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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) Result 1570 states and 4046 transitions. Complement of second has 6 states. [2025-04-26 18:42:47,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:42:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-26 18:42:47,537 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:47,537 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,537 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:47,537 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,537 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:42:47,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1570 states and 4046 transitions. [2025-04-26 18:42:47,548 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:42:47,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1570 states to 732 states and 1852 transitions. [2025-04-26 18:42:47,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2025-04-26 18:42:47,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2025-04-26 18:42:47,555 INFO L74 IsDeterministic]: Start isDeterministic. Operand 732 states and 1852 transitions. [2025-04-26 18:42:47,555 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:47,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 732 states and 1852 transitions. [2025-04-26 18:42:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states and 1852 transitions. [2025-04-26 18:42:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 687. [2025-04-26 18:42:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 687 states have (on average 2.510917030567686) internal successors, (in total 1725), 686 states have internal predecessors, (1725), 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:42:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1725 transitions. [2025-04-26 18:42:47,573 INFO L240 hiAutomatonCegarLoop]: Abstraction has 687 states and 1725 transitions. [2025-04-26 18:42:47,573 INFO L438 stractBuchiCegarLoop]: Abstraction has 687 states and 1725 transitions. [2025-04-26 18:42:47,573 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:47,573 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 1725 transitions. [2025-04-26 18:42:47,576 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 30 [2025-04-26 18:42:47,576 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:47,576 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:47,576 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:47,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:47,577 INFO L752 eck$LassoCheckResult]: Stem: "[80] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[63] L25-->L27: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[83] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[65] L27-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[86] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[62] L25-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[89] L14-->L52: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[66] L34-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[70] L43-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:47,577 INFO L754 eck$LassoCheckResult]: Loop: "[75] L52-->L54: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[77] L54-->L52: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:47,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1954532727, now seen corresponding path program 1 times [2025-04-26 18:42:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785743769] [2025-04-26 18:42:47,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:47,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:47,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:47,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:47,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,591 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 18:42:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531118055] [2025-04-26 18:42:47,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,595 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1405244697, now seen corresponding path program 1 times [2025-04-26 18:42:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:47,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527551106] [2025-04-26 18:42:47,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:47,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:47,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:47,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:47,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,610 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:47,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:47,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:47,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:47,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:47,642 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:47,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:47,642 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:47,642 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:47,642 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:47,642 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,642 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:47,642 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:47,642 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:47,642 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:47,642 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:47,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:47,657 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:47,658 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:47,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,660 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:47,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:47,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:47,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:42:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,681 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:47,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:47,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:47,748 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:47,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:47,753 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:47,753 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:47,753 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:47,753 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:47,753 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:47,753 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,753 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:47,753 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:47,753 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:47,753 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:47,753 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:47,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:47,774 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:47,774 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:47,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,776 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:47,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:47,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:47,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:47,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:47,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:47,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:47,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:47,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:47,792 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:47,794 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:47,794 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:47,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:47,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:47,796 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:47,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:47,797 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:47,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:42:47,801 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:47,801 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:47,801 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:42:47,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:47,807 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:47,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:47,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:47,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:47,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:47,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:47,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:47,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:47,838 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:47,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:47,850 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:42:47,851 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:47,851 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 687 states and 1725 transitions. cyclomatic complexity: 1128 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:42:47,904 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 687 states and 1725 transitions. cyclomatic complexity: 1128. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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) Result 1271 states and 3071 transitions. Complement of second has 6 states. [2025-04-26 18:42:47,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:42:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:42:47,905 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:47,905 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,905 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:47,905 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,905 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:47,905 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:47,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1271 states and 3071 transitions. [2025-04-26 18:42:47,912 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:47,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1271 states to 0 states and 0 transitions. [2025-04-26 18:42:47,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:47,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:47,912 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:47,912 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:47,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:47,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:47,912 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:47,913 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:47,913 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:47,913 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:47,913 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:47,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:47,924 INFO L201 PluginConnector]: Adding new model indep_loops_4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:47 BoogieIcfgContainer [2025-04-26 18:42:47,924 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:47,925 INFO L158 Benchmark]: Toolchain (without parser) took 2611.50ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.4MB in the beginning and 53.1MB in the end (delta: 32.3MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:47,925 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.75ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:47,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.89ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 83.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:47,925 INFO L158 Benchmark]: Boogie Preprocessor took 23.60ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:47,925 INFO L158 Benchmark]: RCFGBuilder took 196.83ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 72.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:47,926 INFO L158 Benchmark]: BuchiAutomizer took 2343.38ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.6MB in the beginning and 53.1MB in the end (delta: 19.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. [2025-04-26 18:42:47,926 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.75ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.89ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 83.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.60ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 196.83ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 72.6MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2343.38ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.6MB in the beginning and 53.1MB in the end (delta: 19.6MB). Peak memory consumption was 17.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 204 StatesRemovedByMinimization, 3 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 75 mSDtfsCounter, 221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 56ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 277, Number of transitions in reduction automaton: 1108, Number of states in reduction automaton: 427, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:47,939 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...