/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/2_thr/seq_loops_indep_2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:24:24,418 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:24:24,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:24:24,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:24:24,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:24:24,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:24:24,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:24:24,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:24:24,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:24:24,494 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:24:24,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:24:24,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:24:24,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:24:24,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:24:24,495 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:24:24,495 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:24:24,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:24:24,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:24:24,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:24:24,759 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:24:24,760 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:24:24,762 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/seq_loops_indep_2.c.bpl [2025-04-26 16:24:24,762 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/seq_loops_indep_2.c.bpl' [2025-04-26 16:24:24,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:24:24,778 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:24:24,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:24,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:24:24,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:24:24,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,813 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:24:24,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:24:24,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:24:24,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:24:24,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:24:24,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:24:24,840 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:24:24,840 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:24:24,840 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:24:24,841 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/1) ... [2025-04-26 16:24:24,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:24,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:24,869 INFO L229 MonitoredProcess]: Starting monitored process 1 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 16:24:24,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:24:24,892 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:24:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:24:24,893 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:24:24,893 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:24:24,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:24:24,893 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:24:24,894 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:24:24,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:24:24,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:24:24,894 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:24:24,934 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:24:24,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:24:25,008 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:24:25,008 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:24:25,017 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:24:25,018 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:24:25,018 INFO L201 PluginConnector]: Adding new model seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:25 BoogieIcfgContainer [2025-04-26 16:24:25,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:24:25,019 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:24:25,019 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:24:25,023 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:24:25,024 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:25,024 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:24:24" (1/2) ... [2025-04-26 16:24:25,025 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10c1a60b and model type seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:24:25, skipping insertion in model container [2025-04-26 16:24:25,025 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:24:25,025 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:24:25" (2/2) ... [2025-04-26 16:24:25,026 INFO L376 chiAutomizerObserver]: Analyzing ICFG seq_loops_indep_2.c.bpl [2025-04-26 16:24:25,067 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:24:25,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 60 flow [2025-04-26 16:24:25,109 INFO L116 PetriNetUnfolderBase]: 4/19 cut-off events. [2025-04-26 16:24:25,110 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:24:25,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 4/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 16:24:25,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 23 transitions, 60 flow [2025-04-26 16:24:25,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 50 flow [2025-04-26 16:24:25,116 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 22 places, 19 transitions, 50 flow [2025-04-26 16:24:25,124 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:24:25,124 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:24:25,124 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:24:25,124 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:24:25,124 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:24:25,124 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:24:25,124 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:24:25,124 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:24:25,126 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:24:25,150 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 16:24:25,150 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:25,150 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:25,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:25,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:25,153 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:24:25,153 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 50 states, but on-demand construction may add more states [2025-04-26 16:24:25,156 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 40 [2025-04-26 16:24:25,156 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:25,156 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:25,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:24:25,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:25,160 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:24:25,160 INFO L754 eck$LassoCheckResult]: Loop: "[53] L21-->L23: 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[]" "[56] L23-->L21: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:24:25,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash 99, now seen corresponding path program 1 times [2025-04-26 16:24:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:25,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144812513] [2025-04-26 16:24:25,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:25,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:25,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:25,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:25,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:25,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:25,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:25,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash 2660, now seen corresponding path program 1 times [2025-04-26 16:24:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:25,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381925242] [2025-04-26 16:24:25,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:25,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:25,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:25,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:25,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:25,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:25,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:25,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:25,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,249 INFO L85 PathProgramCache]: Analyzing trace with hash 96838, now seen corresponding path program 1 times [2025-04-26 16:24:25,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:25,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146531349] [2025-04-26 16:24:25,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:25,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:25,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:25,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:25,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:25,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:25,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:25,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:25,294 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:25,294 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:25,294 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:25,295 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:25,295 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:25,295 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,295 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:25,295 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:25,295 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:25,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:25,295 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:25,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:25,349 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:25,349 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:25,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:25,353 INFO L229 MonitoredProcess]: Starting monitored process 2 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 16:24:25,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:24:25,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:25,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:25,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:24:25,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:25,385 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 16:24:25,386 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 16:24:25,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:25,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:25,463 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:25,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:24:25,468 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:25,468 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:25,468 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:25,468 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:25,468 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:25,468 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,468 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:25,468 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:25,468 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:24:25,468 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:25,468 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:25,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:25,504 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:25,508 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:25,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:25,511 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 16:24:25,512 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 16:24:25,514 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 16:24:25,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:25,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:25,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:25,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:25,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:25,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:25,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:25,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:25,543 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:25,543 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:25,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:25,548 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 16:24:25,567 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:25,567 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 16:24:25,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:25,571 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:25,572 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:25,572 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:24:25,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:24:25,581 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:25,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:24:25,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:24:25,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:25,616 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:25,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:25,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:25,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:25,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:25,624 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:25,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:25,677 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 16:24:25,680 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 50 states, but on-demand construction may add more states 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 16:24:25,827 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 50 states, but on-demand construction may add more states. 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 126 states and 310 transitions. Complement of second has 6 states. [2025-04-26 16:24:25,831 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 16:24:25,833 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 16:24:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:24:25,841 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:24:25,841 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:25,841 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:25,841 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:25,841 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:24:25,841 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:25,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 310 transitions. [2025-04-26 16:24:25,849 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 34 [2025-04-26 16:24:25,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 78 states and 195 transitions. [2025-04-26 16:24:25,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 16:24:25,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2025-04-26 16:24:25,857 INFO L74 IsDeterministic]: Start isDeterministic. Operand 78 states and 195 transitions. [2025-04-26 16:24:25,858 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:25,858 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 195 transitions. [2025-04-26 16:24:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 195 transitions. [2025-04-26 16:24:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2025-04-26 16:24:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.5081967213114753) internal successors, (in total 153), 60 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 153 transitions. [2025-04-26 16:24:25,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 153 transitions. [2025-04-26 16:24:25,884 INFO L438 stractBuchiCegarLoop]: Abstraction has 61 states and 153 transitions. [2025-04-26 16:24:25,884 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:24:25,884 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 153 transitions. [2025-04-26 16:24:25,888 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 34 [2025-04-26 16:24:25,888 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:25,888 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:25,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:25,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:25,888 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[52] L21-->L25-1: 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[]" [2025-04-26 16:24:25,888 INFO L754 eck$LassoCheckResult]: Loop: "[55] L25-1-->L27: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[58] L27-->L25-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:24:25,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 3121, now seen corresponding path program 1 times [2025-04-26 16:24:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:25,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569905475] [2025-04-26 16:24:25,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:25,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:25,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:25,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:25,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:25,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:25,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:25,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2724, now seen corresponding path program 1 times [2025-04-26 16:24:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:25,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023312917] [2025-04-26 16:24:25,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:25,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:25,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:25,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:25,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:25,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:25,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:25,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash 3001044, now seen corresponding path program 1 times [2025-04-26 16:24:25,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:25,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025728086] [2025-04-26 16:24:25,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:25,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:25,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:25,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:25,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:25,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:25,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:25,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:25,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:25,922 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:25,922 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:25,922 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:25,922 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:25,922 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:25,922 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,922 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:25,922 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:25,922 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:25,923 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:25,923 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:25,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:25,948 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:25,948 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:25,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:25,952 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 16:24:25,953 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 16:24:25,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:25,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:25,973 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 16:24:25,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:25,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:25,975 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 16:24:25,975 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 16:24:25,976 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:25,976 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:26,044 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:26,049 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 16:24:26,049 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:26,049 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:26,049 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:26,049 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:26,049 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:26,049 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,049 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:26,049 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:26,049 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:24:26,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:26,049 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:26,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:26,077 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:26,077 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:26,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,079 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 16:24:26,080 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 16:24:26,081 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 16:24:26,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:26,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:26,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:26,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:26,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:26,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:26,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:26,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:26,097 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:26,097 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:24:26,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,099 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 16:24:26,101 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 16:24:26,102 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:26,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:26,106 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:26,106 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:26,107 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:24:26,112 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 16:24:26,114 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:26,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:26,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:26,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:26,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:26,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:26,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:26,172 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 16:24:26,172 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 153 transitions. cyclomatic complexity: 112 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,229 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 153 transitions. cyclomatic complexity: 112. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 117 states and 314 transitions. Complement of second has 6 states. [2025-04-26 16:24:26,232 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 16:24:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 16:24:26,234 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:26,234 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,234 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:26,234 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,234 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:26,234 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 314 transitions. [2025-04-26 16:24:26,236 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 16:24:26,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 79 states and 218 transitions. [2025-04-26 16:24:26,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-04-26 16:24:26,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-04-26 16:24:26,238 INFO L74 IsDeterministic]: Start isDeterministic. Operand 79 states and 218 transitions. [2025-04-26 16:24:26,238 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:26,238 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 218 transitions. [2025-04-26 16:24:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 218 transitions. [2025-04-26 16:24:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2025-04-26 16:24:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.8507462686567164) internal successors, (in total 191), 66 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 191 transitions. [2025-04-26 16:24:26,242 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 191 transitions. [2025-04-26 16:24:26,242 INFO L438 stractBuchiCegarLoop]: Abstraction has 67 states and 191 transitions. [2025-04-26 16:24:26,242 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:24:26,242 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 191 transitions. [2025-04-26 16:24:26,243 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 16:24:26,243 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:26,243 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:26,243 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:24:26,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:26,244 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[71] 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 16:24:26,244 INFO L754 eck$LassoCheckResult]: Loop: "[60] L34-->L36: Formula: (< v_x2_1 v_z_5) InVars {x2=v_x2_1, z=v_z_5} OutVars{x2=v_x2_1, z=v_z_5} AuxVars[] AssignedVars[]" "[63] 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 16:24:26,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 3140, now seen corresponding path program 1 times [2025-04-26 16:24:26,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:26,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383523259] [2025-04-26 16:24:26,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:26,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:26,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:26,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2884, now seen corresponding path program 1 times [2025-04-26 16:24:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:26,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277516023] [2025-04-26 16:24:26,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:26,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:26,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:26,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash 3019463, now seen corresponding path program 1 times [2025-04-26 16:24:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:26,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712831229] [2025-04-26 16:24:26,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:26,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:26,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:26,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:26,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:24:26,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:24:26,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:26,281 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:26,282 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:26,282 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:26,282 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:26,282 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:26,282 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,282 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:26,282 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:26,282 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:26,282 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:26,282 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:26,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:26,305 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:26,305 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:26,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,307 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 16:24:26,308 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 16:24:26,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:26,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:26,325 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 16:24:26,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,327 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 16:24:26,328 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 16:24:26,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:26,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:26,393 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:26,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:26,397 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:26,397 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:26,397 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:26,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:26,398 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:26,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:26,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:26,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:24:26,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:26,398 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:26,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:26,414 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:26,415 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:26,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,416 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 16:24:26,418 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 16:24:26,419 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 16:24:26,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:26,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:26,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:26,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:26,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:26,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:26,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:26,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:26,436 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:24:26,436 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,438 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 16:24:26,439 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 16:24:26,440 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:26,442 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 16:24:26,443 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:26,443 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:26,443 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:24:26,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:26,449 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:26,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:26,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:26,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:26,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:26,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:26,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:26,493 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 16:24:26,493 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 191 transitions. cyclomatic complexity: 144 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,547 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 191 transitions. cyclomatic complexity: 144. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 193 states and 569 transitions. Complement of second has 6 states. [2025-04-26 16:24:26,547 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 16:24:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-26 16:24:26,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:24:26,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:24:26,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:24:26,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 569 transitions. [2025-04-26 16:24:26,551 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:24:26,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 124 states and 340 transitions. [2025-04-26 16:24:26,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-04-26 16:24:26,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2025-04-26 16:24:26,557 INFO L74 IsDeterministic]: Start isDeterministic. Operand 124 states and 340 transitions. [2025-04-26 16:24:26,557 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:26,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 340 transitions. [2025-04-26 16:24:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 340 transitions. [2025-04-26 16:24:26,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2025-04-26 16:24:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 105 states have (on average 2.8) internal successors, (in total 294), 104 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 294 transitions. [2025-04-26 16:24:26,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 105 states and 294 transitions. [2025-04-26 16:24:26,563 INFO L438 stractBuchiCegarLoop]: Abstraction has 105 states and 294 transitions. [2025-04-26 16:24:26,564 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:24:26,564 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 294 transitions. [2025-04-26 16:24:26,568 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 16:24:26,568 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:26,568 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:26,569 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:24:26,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:24:26,569 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[71] 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]" "[59] L34-->L38-1: Formula: (<= v_z_6 v_x2_4) InVars {x2=v_x2_4, z=v_z_6} OutVars{x2=v_x2_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 16:24:26,569 INFO L754 eck$LassoCheckResult]: Loop: "[62] L38-1-->L40: 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[]" "[65] L40-->L38-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:24:26,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,569 INFO L85 PathProgramCache]: Analyzing trace with hash 97399, now seen corresponding path program 1 times [2025-04-26 16:24:26,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:26,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738090440] [2025-04-26 16:24:26,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:26,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:26,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:26,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:26,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,573 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:26,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:26,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:26,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:26,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2948, now seen corresponding path program 1 times [2025-04-26 16:24:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:26,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184743414] [2025-04-26 16:24:26,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:26,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,583 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:26,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:26,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash 93602426, now seen corresponding path program 1 times [2025-04-26 16:24:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:26,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717669233] [2025-04-26 16:24:26,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:26,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:26,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:26,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:26,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:24:26,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:24:26,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:26,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:26,614 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:26,614 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:26,614 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:26,614 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:26,614 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:24:26,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:26,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:26,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:26,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:26,614 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:26,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:26,630 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:26,630 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:24:26,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,642 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 16:24:26,644 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 16:24:26,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:24:26,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:26,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:26,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,664 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 16:24:26,665 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 16:24:26,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:24:26,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:24:26,733 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:24:26,737 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 16:24:26,738 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:26,738 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:26,738 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:26,738 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:26,738 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:26,738 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,738 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:26,738 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:26,738 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:24:26,738 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:26,738 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:26,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:26,754 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:26,754 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:26,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,757 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 16:24:26,758 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 16:24:26,759 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 16:24:26,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:26,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:26,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:26,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:26,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:26,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:26,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:26,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:26,775 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:24:26,775 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:24:26,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:26,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:26,777 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 16:24:26,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 16:24:26,779 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:26,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:24:26,783 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:24:26,783 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:26,784 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:24:26,791 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 16:24:26,792 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:26,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:26,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:24:26,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:24:26,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:26,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:26,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:26,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:24:26,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:24:26,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:26,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:26,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:24:26,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:24:26,839 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 16:24:26,839 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 105 states and 294 transitions. cyclomatic complexity: 212 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,888 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 105 states and 294 transitions. cyclomatic complexity: 212. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 177 states and 472 transitions. Complement of second has 6 states. [2025-04-26 16:24:26,889 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 16:24:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:24:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2025-04-26 16:24:26,889 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:24:26,889 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,889 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:24:26,890 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,890 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:24:26,890 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:26,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 472 transitions. [2025-04-26 16:24:26,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:26,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 0 states and 0 transitions. [2025-04-26 16:24:26,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:24:26,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:24:26,895 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:24:26,895 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:24:26,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:26,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:26,895 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:24:26,895 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:24:26,895 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:24:26,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:24:26,895 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:24:26,903 INFO L201 PluginConnector]: Adding new model seq_loops_indep_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:24:26 BoogieIcfgContainer [2025-04-26 16:24:26,903 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:24:26,904 INFO L158 Benchmark]: Toolchain (without parser) took 2126.19ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 84.6MB in the beginning and 44.9MB in the end (delta: 39.6MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2025-04-26 16:24:26,904 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 85.4MB in the end (delta: 137.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:26,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.49ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 82.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:24:26,904 INFO L158 Benchmark]: Boogie Preprocessor took 23.71ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.6MB in the end (delta: 992.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:24:26,904 INFO L158 Benchmark]: RCFGBuilder took 178.24ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 72.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:24:26,905 INFO L158 Benchmark]: BuchiAutomizer took 1884.10ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.7MB in the beginning and 44.9MB in the end (delta: 27.8MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. [2025-04-26 16:24:26,906 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.76ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 85.4MB in the end (delta: 137.7kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.49ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 82.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.71ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.6MB in the end (delta: 992.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 178.24ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 72.9MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1884.10ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 72.7MB in the beginning and 44.9MB in the end (delta: 27.8MB). Peak memory consumption was 15.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 48 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, 116 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 147 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 56 mSDtfsCounter, 147 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: 63ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - 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 -1 * x3 + 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 * 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 16:24:26,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...