/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:11,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:11,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:49:11,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:11,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:11,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:11,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:11,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:11,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:11,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:11,476 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:11,476 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:11,476 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:11,476 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:11,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:11,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:11,478 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:11,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:11,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:11,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:11,479 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:11,479 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:49:11,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:11,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:11,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:11,721 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:11,721 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:11,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_5.c.bpl [2025-02-17 22:49:11,724 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_5.c.bpl' [2025-02-17 22:49:11,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:11,742 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:11,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:11,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:11,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:11,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,762 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:11,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:11,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:11,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:11,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:11,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:11,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:11,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:11,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:11,783 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/1) ... [2025-02-17 22:49:11,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:11,808 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-02-17 22:49:11,815 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-02-17 22:49:11,835 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:11,836 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:11,836 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:11,836 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:11,836 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:11,837 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:11,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:11,837 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:11,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:11,837 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:49:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:49:11,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:49:11,837 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-02-17 22:49:11,837 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-17 22:49:11,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-17 22:49:11,839 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:49:11,872 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:11,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:11,944 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:11,944 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:11,952 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:11,952 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:11,952 INFO L201 PluginConnector]: Adding new model indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:11 BoogieIcfgContainer [2025-02-17 22:49:11,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:11,953 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:11,953 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:11,958 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:11,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:11,959 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:11" (1/2) ... [2025-02-17 22:49:11,960 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a6ceb78 and model type indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:11, skipping insertion in model container [2025-02-17 22:49:11,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:11,960 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:11" (2/2) ... [2025-02-17 22:49:11,961 INFO L363 chiAutomizerObserver]: Analyzing ICFG indep_loops_5.c.bpl [2025-02-17 22:49:12,015 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-17 22:49:12,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 117 flow [2025-02-17 22:49:12,104 INFO L124 PetriNetUnfolderBase]: 5/31 cut-off events. [2025-02-17 22:49:12,108 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-17 22:49:12,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 5/31 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2025-02-17 22:49:12,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 117 flow [2025-02-17 22:49:12,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 31 transitions, 92 flow [2025-02-17 22:49:12,125 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:13,011 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:13,012 INFO L101 AmpleReduction]: Number of pruned transitions: 913, Number of non-trivial ample sets: 3722 [2025-02-17 22:49:13,012 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 3612 [2025-02-17 22:49:13,021 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:13,021 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:13,021 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:13,021 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:13,021 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:13,021 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:13,021 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:13,021 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:13,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1707 states, 1706 states have (on average 4.3341148886283705) internal successors, (7394), 1706 states have internal predecessors, (7394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:13,118 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 1612 [2025-02-17 22:49:13,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:13,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:13,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:13,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:13,123 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:13,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1707 states, 1706 states have (on average 4.3341148886283705) internal successors, (7394), 1706 states have internal predecessors, (7394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:13,178 INFO L131 ngComponentsAnalysis]: Automaton has 391 accepting balls. 1612 [2025-02-17 22:49:13,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:13,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:13,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-02-17 22:49:13,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:13,184 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:13,184 INFO L754 eck$LassoCheckResult]: Loop: "[78] L27-->L29: 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[]" "[80] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:49:13,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2025-02-17 22:49:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:13,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409318312] [2025-02-17 22:49:13,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:13,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:13,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:13,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:13,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:13,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:13,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:13,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash 3459, now seen corresponding path program 1 times [2025-02-17 22:49:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:13,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400298600] [2025-02-17 22:49:13,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:13,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:13,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:13,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash 127428, now seen corresponding path program 1 times [2025-02-17 22:49:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:13,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029705870] [2025-02-17 22:49:13,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:13,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:13,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:13,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:13,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:13,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:13,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:13,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:13,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:13,347 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:13,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:13,348 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:13,348 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:13,348 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:13,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:13,348 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:13,349 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:13,349 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:13,349 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:13,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:13,394 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:13,394 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:13,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,399 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-02-17 22:49:13,401 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-02-17 22:49:13,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:13,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:13,422 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-02-17 22:49:13,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,425 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-02-17 22:49:13,426 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-02-17 22:49:13,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:13,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:13,500 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:13,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:13,505 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:13,505 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:13,505 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:13,505 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:13,505 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:13,505 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:13,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:13,506 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:13,506 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:13,506 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:13,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:13,537 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:13,540 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:13,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,566 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-02-17 22:49:13,569 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-02-17 22:49:13,570 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-02-17 22:49:13,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:13,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:13,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:13,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:13,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:13,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:13,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:13,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:13,641 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:13,642 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:13,646 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-02-17 22:49:13,648 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-02-17 22:49:13,649 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:13,649 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:13,649 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:13,650 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:49:13,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:13,660 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-17 22:49:13,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-17 22:49:13,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:13,766 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-02-17 22:49:13,772 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1707 states, 1706 states have (on average 4.3341148886283705) internal successors, (7394), 1706 states have internal predecessors, (7394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:14,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1707 states, 1706 states have (on average 4.3341148886283705) internal successors, (7394), 1706 states have internal predecessors, (7394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 4773 states and 22936 transitions. Complement of second has 6 states. [2025-02-17 22:49:14,066 INFO L141 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-02-17 22:49:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-02-17 22:49:14,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 1 letters. Loop has 2 letters. [2025-02-17 22:49:14,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:14,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:14,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:14,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 73 transitions. Stem has 1 letters. Loop has 4 letters. [2025-02-17 22:49:14,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:14,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4773 states and 22936 transitions. [2025-02-17 22:49:14,163 INFO L131 ngComponentsAnalysis]: Automaton has 420 accepting balls. 1477 [2025-02-17 22:49:14,268 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-02-17 22:49:14,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4773 states to 3450 states and 17068 transitions. [2025-02-17 22:49:14,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1556 [2025-02-17 22:49:14,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2476 [2025-02-17 22:49:14,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3450 states and 17068 transitions. [2025-02-17 22:49:14,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:14,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3450 states and 17068 transitions. [2025-02-17 22:49:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states and 17068 transitions. [2025-02-17 22:49:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 2531. [2025-02-17 22:49:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 2531 states have (on average 5.123666534966416) internal successors, (12968), 2530 states have internal predecessors, (12968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 12968 transitions. [2025-02-17 22:49:14,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2531 states and 12968 transitions. [2025-02-17 22:49:14,450 INFO L432 stractBuchiCegarLoop]: Abstraction has 2531 states and 12968 transitions. [2025-02-17 22:49:14,450 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:14,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2531 states and 12968 transitions. [2025-02-17 22:49:14,472 INFO L131 ngComponentsAnalysis]: Automaton has 420 accepting balls. 1477 [2025-02-17 22:49:14,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:14,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:14,473 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:14,473 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:14,474 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[102] L12-->L36: 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-02-17 22:49:14,474 INFO L754 eck$LassoCheckResult]: Loop: "[82] L36-->L38: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[84] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:49:14,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash 4132, now seen corresponding path program 1 times [2025-02-17 22:49:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467623188] [2025-02-17 22:49:14,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 1 times [2025-02-17 22:49:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334237191] [2025-02-17 22:49:14,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash 3973478, now seen corresponding path program 1 times [2025-02-17 22:49:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588989954] [2025-02-17 22:49:14,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:14,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:14,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,530 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,530 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:14,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:14,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,549 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,549 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:14,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,552 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-02-17 22:49:14,553 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-02-17 22:49:14,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:14,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:14,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,576 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-02-17 22:49:14,577 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-02-17 22:49:14,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:14,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,645 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:14,651 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-02-17 22:49:14,651 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,651 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,651 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,651 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,651 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:14,651 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,651 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,652 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,652 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:14,652 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,652 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,677 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,677 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,679 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-02-17 22:49:14,681 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-02-17 22:49:14,682 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-02-17 22:49:14,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:14,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:14,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:14,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:14,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:14,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:14,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:14,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:14,705 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:14,705 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:14,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,708 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-02-17 22:49:14,709 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-02-17 22:49:14,710 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:14,710 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:14,710 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:14,710 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-02-17 22:49:14,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:14,718 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:14,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:14,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:14,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:14,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:14,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:14,757 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-02-17 22:49:14,757 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2531 states and 12968 transitions. cyclomatic complexity: 10962 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:14,999 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2531 states and 12968 transitions. cyclomatic complexity: 10962. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7700 states and 40850 transitions. Complement of second has 6 states. [2025-02-17 22:49:14,999 INFO L141 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-02-17 22:49:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-02-17 22:49:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:15,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7700 states and 40850 transitions. [2025-02-17 22:49:15,143 INFO L131 ngComponentsAnalysis]: Automaton has 434 accepting balls. 1260 [2025-02-17 22:49:15,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7700 states to 5563 states and 29871 transitions. [2025-02-17 22:49:15,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1970 [2025-02-17 22:49:15,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2969 [2025-02-17 22:49:15,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5563 states and 29871 transitions. [2025-02-17 22:49:15,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:15,254 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5563 states and 29871 transitions. [2025-02-17 22:49:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states and 29871 transitions. [2025-02-17 22:49:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 4564. [2025-02-17 22:49:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4564 states have (on average 5.60056967572305) internal successors, (25561), 4563 states have internal predecessors, (25561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 25561 transitions. [2025-02-17 22:49:15,435 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4564 states and 25561 transitions. [2025-02-17 22:49:15,435 INFO L432 stractBuchiCegarLoop]: Abstraction has 4564 states and 25561 transitions. [2025-02-17 22:49:15,435 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:15,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4564 states and 25561 transitions. [2025-02-17 22:49:15,473 INFO L131 ngComponentsAnalysis]: Automaton has 434 accepting balls. 1260 [2025-02-17 22:49:15,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:15,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:15,474 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:15,474 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:15,474 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[102] L12-->L36: 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]" "[105] L13-->L45: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:49:15,475 INFO L754 eck$LassoCheckResult]: Loop: "[86] L45-->L47: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[88] L47-->L45: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:15,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash 128197, now seen corresponding path program 1 times [2025-02-17 22:49:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:15,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507101883] [2025-02-17 22:49:15,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:15,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:15,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:15,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:15,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:15,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:15,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:15,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:15,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:15,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash 3715, now seen corresponding path program 1 times [2025-02-17 22:49:15,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:15,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756230211] [2025-02-17 22:49:15,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:15,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:15,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:15,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:15,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:15,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:15,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:15,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:15,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:15,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:15,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:15,498 INFO L85 PathProgramCache]: Analyzing trace with hash 123200071, now seen corresponding path program 1 times [2025-02-17 22:49:15,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:15,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319374238] [2025-02-17 22:49:15,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:15,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:15,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:15,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:15,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:15,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:15,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:15,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:15,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:15,529 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:15,529 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:15,529 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:15,529 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:15,530 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:15,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:15,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:15,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:15,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:15,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:15,530 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:15,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:15,549 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:15,549 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:15,551 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-02-17 22:49:15,553 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-02-17 22:49:15,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:15,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:15,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:15,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:15,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:15,575 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-02-17 22:49:15,577 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-02-17 22:49:15,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:15,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:15,649 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:15,653 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-02-17 22:49:15,653 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:15,654 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:15,654 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:15,654 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:15,654 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:15,654 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:15,654 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:15,654 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:15,655 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:15,655 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:15,655 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:15,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:15,673 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:15,674 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:15,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:15,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:15,676 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-02-17 22:49:15,744 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-02-17 22:49:15,746 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-02-17 22:49:15,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:15,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:15,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:15,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:15,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:15,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:15,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:15,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:15,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:15,764 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:15,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:15,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:15,784 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-02-17 22:49:15,787 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-02-17 22:49:15,788 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:15,788 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:15,788 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:15,788 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:15,794 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-02-17 22:49:15,796 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:15,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:15,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:15,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:15,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:15,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:15,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:15,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:15,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:15,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:15,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:15,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:15,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-02-17 22:49:15,840 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-02-17 22:49:15,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4564 states and 25561 transitions. cyclomatic complexity: 21735 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:16,073 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4564 states and 25561 transitions. cyclomatic complexity: 21735. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14111 states and 80310 transitions. Complement of second has 6 states. [2025-02-17 22:49:16,074 INFO L141 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-02-17 22:49:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-17 22:49:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:16,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:16,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:16,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14111 states and 80310 transitions. [2025-02-17 22:49:16,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:16,376 INFO L131 ngComponentsAnalysis]: Automaton has 415 accepting balls. 993 [2025-02-17 22:49:16,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14111 states to 9440 states and 54280 transitions. [2025-02-17 22:49:16,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2700 [2025-02-17 22:49:16,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3572 [2025-02-17 22:49:16,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9440 states and 54280 transitions. [2025-02-17 22:49:16,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:16,630 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9440 states and 54280 transitions. [2025-02-17 22:49:16,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-17 22:49:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9440 states and 54280 transitions. [2025-02-17 22:49:16,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9440 to 8076. [2025-02-17 22:49:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8076 states, 8076 states have (on average 5.941926696384349) internal successors, (47987), 8075 states have internal predecessors, (47987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8076 states to 8076 states and 47987 transitions. [2025-02-17 22:49:17,010 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8076 states and 47987 transitions. [2025-02-17 22:49:17,010 INFO L432 stractBuchiCegarLoop]: Abstraction has 8076 states and 47987 transitions. [2025-02-17 22:49:17,010 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:17,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8076 states and 47987 transitions. [2025-02-17 22:49:17,074 INFO L131 ngComponentsAnalysis]: Automaton has 415 accepting balls. 993 [2025-02-17 22:49:17,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:17,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:17,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:17,077 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:17,077 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[102] L12-->L36: 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]" "[105] L13-->L45: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[108] L14-->L54: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-02-17 22:49:17,077 INFO L754 eck$LassoCheckResult]: Loop: "[90] L54-->L56: 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[]" "[92] L56-->L54: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:17,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash 3974215, now seen corresponding path program 1 times [2025-02-17 22:49:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488715991] [2025-02-17 22:49:17,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:17,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:17,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:17,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:17,089 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:17,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:17,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:17,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:17,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:17,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-02-17 22:49:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371057420] [2025-02-17 22:49:17,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:17,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:17,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:17,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:17,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:17,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:17,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:17,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -475743799, now seen corresponding path program 1 times [2025-02-17 22:49:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:17,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010580925] [2025-02-17 22:49:17,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:17,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:17,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:17,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:17,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:17,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:17,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:17,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:17,126 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:17,143 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:17,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:17,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:17,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:17,143 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:17,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:17,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:17,143 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:17,143 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:17,143 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:17,143 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:17,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:17,162 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:17,162 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:17,164 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-02-17 22:49:17,166 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-02-17 22:49:17,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:17,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:17,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:49:17,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:17,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:17,186 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-02-17 22:49:17,187 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-02-17 22:49:17,188 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:17,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:17,258 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:17,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:17,265 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:17,265 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:17,265 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:17,265 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:17,265 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:17,265 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:17,265 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:17,265 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:17,265 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:17,265 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:17,265 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:17,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:17,287 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:17,287 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:17,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:17,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:17,290 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-02-17 22:49:17,291 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-02-17 22:49:17,292 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-02-17 22:49:17,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:17,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:17,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:17,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:17,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:17,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:17,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:17,306 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:17,312 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:17,312 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:17,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:17,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:17,314 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-02-17 22:49:17,317 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-02-17 22:49:17,317 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:17,317 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:17,317 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:17,317 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:17,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:17,324 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:17,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:17,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:17,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:17,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:17,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:17,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:17,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:17,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:17,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:17,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:17,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:17,371 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-02-17 22:49:17,372 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8076 states and 47987 transitions. cyclomatic complexity: 40960 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:17,500 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-02-17 22:49:17,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8076 states and 47987 transitions. cyclomatic complexity: 40960. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23411 states and 140348 transitions. Complement of second has 6 states. [2025-02-17 22:49:17,794 INFO L141 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-02-17 22:49:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-17 22:49:17,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:17,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:17,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:17,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:17,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:17,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:17,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23411 states and 140348 transitions. [2025-02-17 22:49:18,314 INFO L131 ngComponentsAnalysis]: Automaton has 313 accepting balls. 626 [2025-02-17 22:49:18,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23411 states to 12955 states and 78234 transitions. [2025-02-17 22:49:18,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3185 [2025-02-17 22:49:18,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3789 [2025-02-17 22:49:18,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12955 states and 78234 transitions. [2025-02-17 22:49:18,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:18,559 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12955 states and 78234 transitions. [2025-02-17 22:49:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12955 states and 78234 transitions. [2025-02-17 22:49:18,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12955 to 11455. [2025-02-17 22:49:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11455 states, 11455 states have (on average 6.189262330859886) internal successors, (70898), 11454 states have internal predecessors, (70898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11455 states to 11455 states and 70898 transitions. [2025-02-17 22:49:18,992 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11455 states and 70898 transitions. [2025-02-17 22:49:18,992 INFO L432 stractBuchiCegarLoop]: Abstraction has 11455 states and 70898 transitions. [2025-02-17 22:49:18,992 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:18,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11455 states and 70898 transitions. [2025-02-17 22:49:19,127 INFO L131 ngComponentsAnalysis]: Automaton has 313 accepting balls. 626 [2025-02-17 22:49:19,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:19,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:19,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:19,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:19,128 INFO L752 eck$LassoCheckResult]: Stem: "[99] $Ultimate##0-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[102] L12-->L36: 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]" "[105] L13-->L45: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[108] L14-->L54: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L15-->L63: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" [2025-02-17 22:49:19,128 INFO L754 eck$LassoCheckResult]: Loop: "[94] L63-->L65: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[96] L65-->L63: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:19,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 123200776, now seen corresponding path program 1 times [2025-02-17 22:49:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845072931] [2025-02-17 22:49:19,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:19,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:19,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,138 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:19,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:19,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-02-17 22:49:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117542683] [2025-02-17 22:49:19,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1863135542, now seen corresponding path program 1 times [2025-02-17 22:49:19,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:19,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333612517] [2025-02-17 22:49:19,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:19,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:19,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:19,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:19,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:19,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:19,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:19,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:19,193 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:19,193 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:19,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:19,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:19,194 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:19,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:19,194 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:19,194 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:19,194 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:19,194 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:19,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:19,228 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:19,229 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:19,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,231 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:19,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-17 22:49:19,237 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:19,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:19,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:19,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,287 INFO L229 MonitoredProcess]: Starting monitored process 19 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-02-17 22:49:19,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:19,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:19,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-17 22:49:19,399 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:19,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:19,405 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:19,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:19,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:19,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:19,405 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:19,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:19,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:19,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:19,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:19,405 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:19,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:19,443 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:19,444 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,448 INFO L229 MonitoredProcess]: Starting monitored process 20 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-02-17 22:49:19,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-17 22:49:19,452 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-02-17 22:49:19,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:19,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:19,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:19,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:19,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:19,472 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:19,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:19,474 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:19,475 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:19,475 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:19,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:19,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:19,477 INFO L229 MonitoredProcess]: Starting monitored process 21 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-02-17 22:49:19,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-17 22:49:19,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:19,480 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:19,480 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:19,480 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-02-17 22:49:19,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:19,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:19,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:19,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:19,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:19,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:19,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:19,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:19,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:19,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:19,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:19,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:19,522 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:19,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:19,541 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-02-17 22:49:19,541 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11455 states and 70898 transitions. cyclomatic complexity: 60726 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:19,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:49:19,934 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11455 states and 70898 transitions. cyclomatic complexity: 60726. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28385 states and 174428 transitions. Complement of second has 6 states. [2025-02-17 22:49:19,934 INFO L141 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-02-17 22:49:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-02-17 22:49:19,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:19,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:19,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:19,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:19,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 84 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:19,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:19,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28385 states and 174428 transitions. [2025-02-17 22:49:20,482 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:20,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28385 states to 0 states and 0 transitions. [2025-02-17 22:49:20,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:20,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:20,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:20,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:20,483 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:20,483 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:20,483 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:20,483 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:20,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:20,483 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:20,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:20,490 INFO L201 PluginConnector]: Adding new model indep_loops_5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:20 BoogieIcfgContainer [2025-02-17 22:49:20,490 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:20,491 INFO L158 Benchmark]: Toolchain (without parser) took 8748.70ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 82.5MB in the beginning and 1.0GB in the end (delta: -962.4MB). Peak memory consumption was 380.9MB. Max. memory is 8.0GB. [2025-02-17 22:49:20,491 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 115.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:20,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.57ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:20,491 INFO L158 Benchmark]: Boogie Preprocessor took 15.63ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 80.4MB in the end (delta: 734.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:20,492 INFO L158 Benchmark]: RCFGBuilder took 169.97ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 71.4MB in the end (delta: 9.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-02-17 22:49:20,492 INFO L158 Benchmark]: BuchiAutomizer took 8537.05ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 71.3MB in the beginning and 1.0GB in the end (delta: -973.6MB). Peak memory consumption was 376.7MB. Max. memory is 8.0GB. [2025-02-17 22:49:20,493 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.14ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 115.0kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.57ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 15.63ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 80.4MB in the end (delta: 734.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 169.97ms. Allocated memory is still 155.2MB. Free memory was 80.4MB in the beginning and 71.4MB in the end (delta: 9.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 8537.05ms. Allocated memory was 155.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 71.3MB in the beginning and 1.0GB in the end (delta: -973.6MB). Peak memory consumption was 376.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.4s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 1.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4782 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 2.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 277 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 272 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 375 IncrementalHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 125 mSDtfsCounter, 375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 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: 109ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.9s InitialAbstraction: Time to compute Ample Reduction [ms]: 959, Trivial Ample Sets caused by loops: 3612, Number of non-trivial ample sets: 3722, Number of pruned transitions: 913, Number of transitions in reduction automaton: 7394, Number of states in reduction automaton: 1707, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:20,506 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...