/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/pp5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:52:10,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:52:10,332 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:52:10,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:52:10,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:52:10,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:52:10,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:52:10,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:52:10,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:52:10,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:52:10,363 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:52:10,363 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:52:10,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:52:10,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:52:10,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:52:10,365 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:52:10,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:52:10,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:52:10,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:52:10,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:52:10,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:52:10,366 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:52:10,366 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:52:10,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:52:10,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:52:10,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:52:10,610 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:52:10,612 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:52:10,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/pp5.c.bpl [2025-02-17 22:52:10,614 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/pp5.c.bpl' [2025-02-17 22:52:10,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:52:10,627 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:52:10,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:52:10,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:52:10,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:52:10,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,643 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:52:10,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:52:10,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:52:10,645 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:52:10,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:52:10,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:52:10,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:52:10,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:52:10,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:52:10,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/1) ... [2025-02-17 22:52:10,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:10,689 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:52:10,691 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:52:10,709 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:52:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:52:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:52:10,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:52:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:52:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:52:10,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:52:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:52:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:52:10,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:52:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:52:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:52:10,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:52:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:52:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:52:10,710 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-02-17 22:52:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-17 22:52:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-17 22:52:10,711 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:52:10,749 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:52:10,751 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:52:10,854 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:52:10,854 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:52:10,868 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:52:10,868 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:52:10,869 INFO L201 PluginConnector]: Adding new model pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:52:10 BoogieIcfgContainer [2025-02-17 22:52:10,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:52:10,871 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:52:10,871 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:52:10,877 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:52:10,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:52:10,878 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:52:10" (1/2) ... [2025-02-17 22:52:10,879 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@384e3930 and model type pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:52:10, skipping insertion in model container [2025-02-17 22:52:10,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:52:10,880 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:52:10" (2/2) ... [2025-02-17 22:52:10,881 INFO L363 chiAutomizerObserver]: Analyzing ICFG pp5.c.bpl [2025-02-17 22:52:10,948 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-17 22:52:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 52 transitions, 139 flow [2025-02-17 22:52:11,012 INFO L124 PetriNetUnfolderBase]: 5/42 cut-off events. [2025-02-17 22:52:11,016 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-17 22:52:11,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 42 events. 5/42 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-02-17 22:52:11,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 139 flow [2025-02-17 22:52:11,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 42 transitions, 114 flow [2025-02-17 22:52:11,034 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:52:13,686 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:52:13,687 INFO L101 AmpleReduction]: Number of pruned transitions: 17023, Number of non-trivial ample sets: 22107 [2025-02-17 22:52:13,687 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 14611 [2025-02-17 22:52:13,703 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:52:13,703 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:52:13,703 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:52:13,704 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:52:13,704 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:52:13,704 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:52:13,704 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:52:13,704 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:52:13,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10888 states, 10887 states have (on average 3.3791678148250206) internal successors, (36789), 10887 states have internal predecessors, (36789), 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:52:13,978 INFO L131 ngComponentsAnalysis]: Automaton has 806 accepting balls. 8094 [2025-02-17 22:52:13,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:52:13,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:52:13,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:52:13,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:52:13,984 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:52:14,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10888 states, 10887 states have (on average 3.3791678148250206) internal successors, (36789), 10887 states have internal predecessors, (36789), 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:52:14,228 INFO L131 ngComponentsAnalysis]: Automaton has 806 accepting balls. 8094 [2025-02-17 22:52:14,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:52:14,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:52:14,230 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:52:14,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:52:14,234 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-02-17 22:52:14,235 INFO L754 eck$LassoCheckResult]: Loop: "[100] L32-->L34: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[102] L34-->L35: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[104] L35-->L32: Formula: (= (+ v_c_2 1) v_c_1) InVars {c=v_c_2} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" [2025-02-17 22:52:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash 3823, now seen corresponding path program 1 times [2025-02-17 22:52:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:14,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964151807] [2025-02-17 22:52:14,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:14,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:14,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:52:14,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:52:14,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:14,297 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:52:14,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:52:14,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:14,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:14,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash 129157, now seen corresponding path program 1 times [2025-02-17 22:52:14,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:14,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645617716] [2025-02-17 22:52:14,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:14,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:14,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:14,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:14,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:14,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:14,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:14,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:14,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:14,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 113990359, now seen corresponding path program 1 times [2025-02-17 22:52:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158330688] [2025-02-17 22:52:14,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:14,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:52:14,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:52:14,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:14,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:14,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:52:14,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:52:14,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:14,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:14,379 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:14,379 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:14,379 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:14,379 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:14,379 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:52:14,379 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,380 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:14,380 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:14,380 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:52:14,380 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:14,380 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:14,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:14,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:14,481 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:14,494 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:52:14,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:14,503 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:52:14,517 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:52:14,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:52:14,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:14,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:52:14,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:14,545 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:52:14,547 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:52:14,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:52:14,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:14,584 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:52:14,585 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-02-17 22:52:14,590 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:52:14,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:14,593 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:52:14,594 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:52:14,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:52:14,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:14,612 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:52:14,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:14,614 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:52:14,615 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:52:14,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:52:14,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:14,685 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:52:14,689 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:52:14,689 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:14,689 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:14,690 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:14,690 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:14,690 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:52:14,690 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,690 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:14,690 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:14,690 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:52:14,690 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:14,690 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:14,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:14,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:14,726 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:14,730 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:52:14,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:14,734 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:52:14,737 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:52:14,738 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:52:14,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:52:14,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:52:14,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:52:14,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:52:14,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:52:14,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:52:14,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:52:14,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:52:14,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:52:14,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:14,767 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:52:14,768 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:52:14,769 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:52:14,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:52:14,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:52:14,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:52:14,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:52:14,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:52:14,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:52:14,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:52:14,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:52:14,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:52:14,786 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:52:14,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:14,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:14,789 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:52:14,791 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:52:14,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:52:14,792 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:52:14,792 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:52:14,793 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-02-17 22:52:14,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:52:14,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:52:14,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:14,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:52:14,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:52:14,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:14,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:52:14,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:14,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:14,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:14,845 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:52:14,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:14,881 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:52:14,895 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:52:14,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10888 states, 10887 states have (on average 3.3791678148250206) internal successors, (36789), 10887 states have internal predecessors, (36789), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:52:15,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:52:15,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10888 states, 10887 states have (on average 3.3791678148250206) internal successors, (36789), 10887 states have internal predecessors, (36789), 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 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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 26359 states and 98873 transitions. Complement of second has 6 states. [2025-02-17 22:52:15,520 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:52:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 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:52:15,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-17 22:52:15,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 3 letters. [2025-02-17 22:52:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:15,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:52:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:15,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 2 letters. Loop has 6 letters. [2025-02-17 22:52:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:15,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26359 states and 98873 transitions. [2025-02-17 22:52:15,912 INFO L131 ngComponentsAnalysis]: Automaton has 812 accepting balls. 6417 [2025-02-17 22:52:16,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26359 states to 18753 states and 76582 transitions. [2025-02-17 22:52:16,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9936 [2025-02-17 22:52:16,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12871 [2025-02-17 22:52:16,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18753 states and 76582 transitions. [2025-02-17 22:52:16,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:52:16,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18753 states and 76582 transitions. [2025-02-17 22:52:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18753 states and 76582 transitions. [2025-02-17 22:52:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18753 to 15827. [2025-02-17 22:52:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15827 states, 15827 states have (on average 4.004296455424275) internal successors, (63376), 15826 states have internal predecessors, (63376), 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:52:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15827 states to 15827 states and 63376 transitions. [2025-02-17 22:52:17,151 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15827 states and 63376 transitions. [2025-02-17 22:52:17,151 INFO L432 stractBuchiCegarLoop]: Abstraction has 15827 states and 63376 transitions. [2025-02-17 22:52:17,152 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:52:17,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15827 states and 63376 transitions. [2025-02-17 22:52:17,340 INFO L131 ngComponentsAnalysis]: Automaton has 812 accepting balls. 6417 [2025-02-17 22:52:17,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:52:17,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:52:17,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:52:17,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:52:17,341 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" [2025-02-17 22:52:17,341 INFO L754 eck$LassoCheckResult]: Loop: "[106] L43-->L45: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[108] L45-->L46: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[110] L46-->L43: Formula: (= (+ v_c_4 1) v_c_3) InVars {c=v_c_4} OutVars{c=v_c_3} AuxVars[] AssignedVars[c]" [2025-02-17 22:52:17,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -761296813, now seen corresponding path program 1 times [2025-02-17 22:52:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:17,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800133429] [2025-02-17 22:52:17,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:17,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:52:17,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:52:17,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:17,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:17,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:52:17,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:52:17,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:17,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:17,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash 135115, now seen corresponding path program 1 times [2025-02-17 22:52:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:17,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787045870] [2025-02-17 22:52:17,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:17,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:17,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:17,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:17,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:17,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:17,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:17,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:17,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1929039417, now seen corresponding path program 1 times [2025-02-17 22:52:17,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:17,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345373367] [2025-02-17 22:52:17,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:17,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:17,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:52:17,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:52:17,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:17,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:17,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:52:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:52:17,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:17,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:17,384 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:17,384 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:17,384 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:17,385 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:17,385 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:52:17,385 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,385 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:17,385 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:17,385 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:52:17,385 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:17,385 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:17,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:17,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:17,411 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:17,411 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:52:17,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:17,414 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:52:17,415 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:52:17,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:52:17,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:17,431 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:52:17,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:17,433 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:52:17,434 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:52:17,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:52:17,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:17,468 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:52:17,469 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-02-17 22:52:17,474 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:52:17,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:17,476 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:52:17,477 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:52:17,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:52:17,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:17,494 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:52:17,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:17,496 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:52:17,497 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:52:17,499 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:52:17,499 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:17,560 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:52:17,564 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:52:17,564 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:17,564 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:17,564 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:17,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:17,564 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:52:17,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:17,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:17,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:52:17,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:17,564 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:17,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:17,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:17,593 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:17,593 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:52:17,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:17,595 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:52:17,597 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:52:17,598 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:52:17,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:52:17,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:52:17,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:52:17,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:52:17,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:52:17,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:52:17,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:52:17,611 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:52:17,617 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:52:17,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:17,619 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:52:17,620 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:52:17,622 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:52:17,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:52:17,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:52:17,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:52:17,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:52:17,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:52:17,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:52:17,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:52:17,635 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:52:17,638 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:52:17,638 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:52:17,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:17,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:17,640 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:52:17,642 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:52:17,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:52:17,642 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:52:17,642 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:52:17,642 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-02-17 22:52:17,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:52:17,649 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:52:17,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:17,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:52:17,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:52:17,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:17,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:52:17,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:17,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:17,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:17,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:17,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:17,678 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:52:17,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:17,702 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:52:17,703 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:52:17,703 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15827 states and 63376 transitions. cyclomatic complexity: 48621 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:52:18,178 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15827 states and 63376 transitions. cyclomatic complexity: 48621. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 39291 states and 166915 transitions. Complement of second has 6 states. [2025-02-17 22:52:18,178 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:52:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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:52:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-17 22:52:18,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-17 22:52:18,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:18,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 9 letters. Loop has 3 letters. [2025-02-17 22:52:18,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:18,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 6 letters. [2025-02-17 22:52:18,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:18,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39291 states and 166915 transitions. [2025-02-17 22:52:18,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-17 22:52:18,758 INFO L131 ngComponentsAnalysis]: Automaton has 999 accepting balls. 5595 [2025-02-17 22:52:19,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39291 states to 28115 states and 124435 transitions. [2025-02-17 22:52:19,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10922 [2025-02-17 22:52:19,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13415 [2025-02-17 22:52:19,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28115 states and 124435 transitions. [2025-02-17 22:52:19,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:52:19,181 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28115 states and 124435 transitions. [2025-02-17 22:52:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28115 states and 124435 transitions. [2025-02-17 22:52:19,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28115 to 25622. [2025-02-17 22:52:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25622 states, 25622 states have (on average 4.429045351650925) internal successors, (113481), 25621 states have internal predecessors, (113481), 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:52:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25622 states to 25622 states and 113481 transitions. [2025-02-17 22:52:20,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25622 states and 113481 transitions. [2025-02-17 22:52:20,033 INFO L432 stractBuchiCegarLoop]: Abstraction has 25622 states and 113481 transitions. [2025-02-17 22:52:20,033 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:52:20,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25622 states and 113481 transitions. [2025-02-17 22:52:20,297 INFO L131 ngComponentsAnalysis]: Automaton has 999 accepting balls. 5595 [2025-02-17 22:52:20,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:52:20,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:52:20,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:52:20,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:52:20,298 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[106] L43-->L45: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" [2025-02-17 22:52:20,298 INFO L754 eck$LassoCheckResult]: Loop: "[112] L54-->L56: Formula: (< v_y1_1 v_z1_3) InVars {y1=v_y1_1, z1=v_z1_3} OutVars{y1=v_y1_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[114] L56-->L57: Formula: (= v_y1_2 (+ v_y1_3 1)) InVars {y1=v_y1_3} OutVars{y1=v_y1_2} AuxVars[] AssignedVars[y1]" "[116] L57-->L54: Formula: (= v_c_5 (+ v_c_6 1)) InVars {c=v_c_6} OutVars{c=v_c_5} AuxVars[] AssignedVars[c]" [2025-02-17 22:52:20,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:20,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1461793547, now seen corresponding path program 1 times [2025-02-17 22:52:20,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:20,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81511051] [2025-02-17 22:52:20,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:20,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:20,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:52:20,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:52:20,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:20,303 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:20,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:52:20,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:52:20,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:20,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:20,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash 141073, now seen corresponding path program 1 times [2025-02-17 22:52:20,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:20,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620363821] [2025-02-17 22:52:20,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:20,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:20,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:20,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:20,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:20,313 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:20,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:20,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:20,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:20,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:20,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:20,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1618033251, now seen corresponding path program 1 times [2025-02-17 22:52:20,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238468811] [2025-02-17 22:52:20,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:20,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:20,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:52:20,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:52:20,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:20,327 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:20,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:52:20,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:52:20,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:20,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:20,347 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:20,348 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:20,348 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:20,348 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:20,348 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:52:20,348 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:20,348 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:20,348 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:20,348 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:52:20,348 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:20,348 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:20,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:20,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:20,371 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:20,371 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:52:20,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:20,373 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:52:20,374 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:52:20,376 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:52:20,376 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:20,391 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:52:20,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:20,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:20,393 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:52:20,395 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:52:20,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:52:20,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:20,458 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:52:20,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-17 22:52:20,462 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:20,462 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:20,462 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:20,462 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:20,463 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:52:20,463 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:20,463 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:20,463 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:20,463 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:52:20,463 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:20,463 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:20,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:20,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:20,492 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:20,492 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:52:20,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:20,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:20,494 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:52:20,495 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:52:20,496 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:52:20,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:52:20,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:52:20,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:52:20,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:52:20,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:52:20,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:52:20,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:52:20,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:52:20,515 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:52:20,515 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:52:20,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:20,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:20,517 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:52:20,519 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:52:20,520 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:52:20,520 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:52:20,520 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:52:20,520 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, z1) = -1*y1 + 1*z1 Supporting invariants [] [2025-02-17 22:52:20,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-17 22:52:20,525 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:52:20,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:20,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:52:20,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:52:20,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:20,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:52:20,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:20,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:20,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:20,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:20,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:20,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:52:20,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:20,593 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:52:20,593 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:52:20,594 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25622 states and 113481 transitions. cyclomatic complexity: 89546 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:52:20,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:52:21,554 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25622 states and 113481 transitions. cyclomatic complexity: 89546. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 69658 states and 321139 transitions. Complement of second has 6 states. [2025-02-17 22:52:21,555 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:52:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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:52:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-02-17 22:52:21,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:52:21,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:21,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 11 letters. Loop has 3 letters. [2025-02-17 22:52:21,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:21,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 110 transitions. Stem has 8 letters. Loop has 6 letters. [2025-02-17 22:52:21,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:21,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69658 states and 321139 transitions. [2025-02-17 22:52:22,716 INFO L131 ngComponentsAnalysis]: Automaton has 872 accepting balls. 3575 [2025-02-17 22:52:23,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69658 states to 45178 states and 215344 transitions. [2025-02-17 22:52:23,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12487 [2025-02-17 22:52:23,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14919 [2025-02-17 22:52:23,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45178 states and 215344 transitions. [2025-02-17 22:52:23,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:52:23,378 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45178 states and 215344 transitions. [2025-02-17 22:52:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45178 states and 215344 transitions. [2025-02-17 22:52:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45178 to 41329. [2025-02-17 22:52:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41329 states, 41329 states have (on average 4.805681240775242) internal successors, (198614), 41328 states have internal predecessors, (198614), 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:52:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41329 states to 41329 states and 198614 transitions. [2025-02-17 22:52:24,466 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41329 states and 198614 transitions. [2025-02-17 22:52:24,466 INFO L432 stractBuchiCegarLoop]: Abstraction has 41329 states and 198614 transitions. [2025-02-17 22:52:24,466 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:52:24,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41329 states and 198614 transitions. [2025-02-17 22:52:24,909 INFO L131 ngComponentsAnalysis]: Automaton has 872 accepting balls. 3575 [2025-02-17 22:52:24,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:52:24,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:52:24,910 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:52:24,910 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:52:24,910 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[106] L43-->L45: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" "[143] L19-->L65: Formula: (and (= v_thread4Thread1of1ForFork4_thidvar2_2 4) (= v_thread4Thread1of1ForFork4_thidvar0_2 4) (= v_thread4Thread1of1ForFork4_thidvar1_2 4) (= v_thread4Thread1of1ForFork4_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork4_thidvar0=v_thread4Thread1of1ForFork4_thidvar0_2, thread4Thread1of1ForFork4_thidvar1=v_thread4Thread1of1ForFork4_thidvar1_2, thread4Thread1of1ForFork4_thidvar2=v_thread4Thread1of1ForFork4_thidvar2_2, thread4Thread1of1ForFork4_thidvar3=v_thread4Thread1of1ForFork4_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork4_thidvar0, thread4Thread1of1ForFork4_thidvar1, thread4Thread1of1ForFork4_thidvar2, thread4Thread1of1ForFork4_thidvar3]" [2025-02-17 22:52:24,910 INFO L754 eck$LassoCheckResult]: Loop: "[118] L65-->L67: Formula: (< v_y2_1 v_z1_5) InVars {y2=v_y2_1, z1=v_z1_5} OutVars{y2=v_y2_1, z1=v_z1_5} AuxVars[] AssignedVars[]" "[120] L67-->L68: Formula: (= v_y2_2 (+ v_y2_3 1)) InVars {y2=v_y2_3} OutVars{y2=v_y2_2} AuxVars[] AssignedVars[y2]" "[122] L68-->L65: Formula: (= v_c_7 (+ v_c_8 1)) InVars {c=v_c_8} OutVars{c=v_c_7} AuxVars[] AssignedVars[c]" [2025-02-17 22:52:24,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:24,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1929040442, now seen corresponding path program 1 times [2025-02-17 22:52:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:24,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75018399] [2025-02-17 22:52:24,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:24,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:24,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:52:24,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:52:24,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:24,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:24,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:24,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:52:24,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:52:24,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:24,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:24,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:24,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash 147031, now seen corresponding path program 1 times [2025-02-17 22:52:24,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:24,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2730831] [2025-02-17 22:52:24,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:24,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:24,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:24,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:24,931 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:24,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:24,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:24,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:24,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:24,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:24,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:24,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1381504382, now seen corresponding path program 1 times [2025-02-17 22:52:24,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:24,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537287967] [2025-02-17 22:52:24,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:24,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:24,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:52:24,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:52:24,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:24,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:24,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:24,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-17 22:52:24,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-17 22:52:24,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:24,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:24,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:24,972 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:24,972 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:24,972 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:24,972 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:24,972 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:52:24,972 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:24,972 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:24,972 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:24,972 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:52:24,972 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:24,973 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:24,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:24,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:24,996 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:24,996 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:52:24,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:24,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:24,998 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:52:24,999 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:52:25,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:52:25,001 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:25,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:52:25,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:25,027 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:52:25,028 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:52:25,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:52:25,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:25,091 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:52:25,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-17 22:52:25,095 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:25,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:25,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:25,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:25,095 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:52:25,095 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:25,095 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:25,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:25,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:52:25,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:25,095 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:25,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:25,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:25,120 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:25,120 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:52:25,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:25,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:25,122 INFO L229 MonitoredProcess]: Starting monitored process 22 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:52:25,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:52:25,125 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:52:25,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:52:25,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:52:25,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:52:25,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:52:25,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:52:25,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:52:25,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:52:25,137 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:52:25,139 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:52:25,139 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:52:25,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:25,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:25,141 INFO L229 MonitoredProcess]: Starting monitored process 23 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:52:25,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:52:25,144 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:52:25,144 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:52:25,144 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:52:25,144 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, y2) = 1*z1 - 1*y2 Supporting invariants [] [2025-02-17 22:52:25,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-17 22:52:25,149 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:52:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:25,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-17 22:52:25,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-17 22:52:25,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:25,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:25,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:52:25,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:25,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:25,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:25,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:25,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:25,185 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:52:25,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:25,212 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:52:25,213 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:52:25,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41329 states and 198614 transitions. cyclomatic complexity: 159556 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52:25,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:52:26,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41329 states and 198614 transitions. cyclomatic complexity: 159556. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 112812 states and 552709 transitions. Complement of second has 6 states. [2025-02-17 22:52:26,708 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:52:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:52:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-17 22:52:26,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 9 letters. Loop has 3 letters. [2025-02-17 22:52:26,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:26,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 12 letters. Loop has 3 letters. [2025-02-17 22:52:26,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:26,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 9 letters. Loop has 6 letters. [2025-02-17 22:52:26,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:26,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112812 states and 552709 transitions. [2025-02-17 22:52:28,513 INFO L131 ngComponentsAnalysis]: Automaton has 688 accepting balls. 2064 [2025-02-17 22:52:29,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112812 states to 59779 states and 303325 transitions. [2025-02-17 22:52:29,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13131 [2025-02-17 22:52:29,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14735 [2025-02-17 22:52:29,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59779 states and 303325 transitions. [2025-02-17 22:52:29,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:52:29,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59779 states and 303325 transitions. [2025-02-17 22:52:29,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59779 states and 303325 transitions. [2025-02-17 22:52:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59779 to 55771. [2025-02-17 22:52:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55771 states, 55771 states have (on average 5.107385558802962) internal successors, (284844), 55770 states have internal predecessors, (284844), 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:52:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55771 states to 55771 states and 284844 transitions. [2025-02-17 22:52:30,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55771 states and 284844 transitions. [2025-02-17 22:52:30,978 INFO L432 stractBuchiCegarLoop]: Abstraction has 55771 states and 284844 transitions. [2025-02-17 22:52:30,978 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:52:30,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55771 states and 284844 transitions. [2025-02-17 22:52:31,588 INFO L131 ngComponentsAnalysis]: Automaton has 688 accepting balls. 2064 [2025-02-17 22:52:31,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:52:31,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:52:31,588 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:52:31,588 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:52:31,589 INFO L752 eck$LassoCheckResult]: Stem: "[88] $Ultimate##0-->L17: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[134] L17-->L32: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[99] L32-->L37: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[101] L37-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[103] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[137] L17-1-->L43: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_2) (= 2 v_thread2Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_2, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" "[106] L43-->L45: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[140] L18-->L54: Formula: (and (= v_thread3Thread1of1ForFork3_thidvar2_2 3) (= v_thread3Thread1of1ForFork3_thidvar1_2 3) (= v_thread3Thread1of1ForFork3_thidvar0_2 3)) InVars {} OutVars{thread3Thread1of1ForFork3_thidvar0=v_thread3Thread1of1ForFork3_thidvar0_2, thread3Thread1of1ForFork3_thidvar2=v_thread3Thread1of1ForFork3_thidvar2_2, thread3Thread1of1ForFork3_thidvar1=v_thread3Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_thidvar0, thread3Thread1of1ForFork3_thidvar2, thread3Thread1of1ForFork3_thidvar1]" "[143] L19-->L65: Formula: (and (= v_thread4Thread1of1ForFork4_thidvar2_2 4) (= v_thread4Thread1of1ForFork4_thidvar0_2 4) (= v_thread4Thread1of1ForFork4_thidvar1_2 4) (= v_thread4Thread1of1ForFork4_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork4_thidvar0=v_thread4Thread1of1ForFork4_thidvar0_2, thread4Thread1of1ForFork4_thidvar1=v_thread4Thread1of1ForFork4_thidvar1_2, thread4Thread1of1ForFork4_thidvar2=v_thread4Thread1of1ForFork4_thidvar2_2, thread4Thread1of1ForFork4_thidvar3=v_thread4Thread1of1ForFork4_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork4_thidvar0, thread4Thread1of1ForFork4_thidvar1, thread4Thread1of1ForFork4_thidvar2, thread4Thread1of1ForFork4_thidvar3]" "[131] L20-->L76: Formula: (and (= 5 v_thread5Thread1of1ForFork0_thidvar4_2) (= 5 v_thread5Thread1of1ForFork0_thidvar3_2) (= 5 v_thread5Thread1of1ForFork0_thidvar2_2) (= 5 v_thread5Thread1of1ForFork0_thidvar1_2) (= 5 v_thread5Thread1of1ForFork0_thidvar0_2)) InVars {} OutVars{thread5Thread1of1ForFork0_thidvar4=v_thread5Thread1of1ForFork0_thidvar4_2, thread5Thread1of1ForFork0_thidvar3=v_thread5Thread1of1ForFork0_thidvar3_2, thread5Thread1of1ForFork0_thidvar2=v_thread5Thread1of1ForFork0_thidvar2_2, thread5Thread1of1ForFork0_thidvar1=v_thread5Thread1of1ForFork0_thidvar1_2, thread5Thread1of1ForFork0_thidvar0=v_thread5Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_thidvar4, thread5Thread1of1ForFork0_thidvar3, thread5Thread1of1ForFork0_thidvar2, thread5Thread1of1ForFork0_thidvar1, thread5Thread1of1ForFork0_thidvar0]" [2025-02-17 22:52:31,589 INFO L754 eck$LassoCheckResult]: Loop: "[124] L76-->L78: Formula: (< v_x3_1 v_z1_7) InVars {x3=v_x3_1, z1=v_z1_7} OutVars{x3=v_x3_1, z1=v_z1_7} AuxVars[] AssignedVars[]" "[126] L78-->L79: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[128] L79-->L76: Formula: (= (+ v_c_10 1) v_c_9) InVars {c=v_c_10} OutVars{c=v_c_9} AuxVars[] AssignedVars[c]" [2025-02-17 22:52:31,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash -329288311, now seen corresponding path program 1 times [2025-02-17 22:52:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078717715] [2025-02-17 22:52:31,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:31,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:52:31,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:52:31,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:31,594 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:31,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:52:31,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:52:31,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:31,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:31,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash 152989, now seen corresponding path program 1 times [2025-02-17 22:52:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:31,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379321443] [2025-02-17 22:52:31,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:31,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:31,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:31,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:31,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:31,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:31,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:31,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:31,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:31,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:31,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:31,604 INFO L85 PathProgramCache]: Analyzing trace with hash -122645739, now seen corresponding path program 1 times [2025-02-17 22:52:31,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:52:31,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535424181] [2025-02-17 22:52:31,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:52:31,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:52:31,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:52:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:52:31,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:31,608 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:52:31,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-17 22:52:31,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-17 22:52:31,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:52:31,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:52:31,639 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:31,639 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:31,639 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:31,639 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:31,639 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:52:31,639 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:31,639 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:31,639 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:31,639 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:52:31,639 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:31,639 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:31,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:31,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:31,663 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:31,663 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:52:31,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:31,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:31,665 INFO L229 MonitoredProcess]: Starting monitored process 24 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:52:31,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:52:31,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:52:31,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:31,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-17 22:52:31,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:31,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:31,683 INFO L229 MonitoredProcess]: Starting monitored process 25 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:52:31,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:52:31,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:52:31,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:52:31,744 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:52:31,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-17 22:52:31,747 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:52:31,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:52:31,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:52:31,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:52:31,747 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:52:31,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:31,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:52:31,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:52:31,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: pp5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:52:31,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:52:31,748 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:52:31,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:31,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:52:31,776 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:52:31,776 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:52:31,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:31,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:31,778 INFO L229 MonitoredProcess]: Starting monitored process 26 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:52:31,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:52:31,781 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:52:31,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:52:31,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:52:31,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:52:31,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:52:31,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:52:31,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:52:31,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:52:31,795 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:52:31,797 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:52:31,797 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:52:31,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:52:31,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:52:31,799 INFO L229 MonitoredProcess]: Starting monitored process 27 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:52:31,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:52:31,801 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:52:31,801 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:52:31,801 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:52:31,801 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-02-17 22:52:31,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:52:31,807 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:52:31,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:52:31,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-17 22:52:31,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-17 22:52:31,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:31,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:52:31,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:31,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:52:31,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:52:31,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:52:31,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:52:31,846 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:52:31,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:52:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:52:31,874 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:52:31,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55771 states and 284844 transitions. cyclomatic complexity: 231899 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:52:32,213 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2025-02-17 22:52:32,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:52:33,500 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55771 states and 284844 transitions. cyclomatic complexity: 231899. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 144810 states and 763900 transitions. Complement of second has 6 states. [2025-02-17 22:52:33,501 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:52:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:52:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-02-17 22:52:33,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 10 letters. Loop has 3 letters. [2025-02-17 22:52:33,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:33,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-17 22:52:33,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:33,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 116 transitions. Stem has 10 letters. Loop has 6 letters. [2025-02-17 22:52:33,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:52:33,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144810 states and 763900 transitions. [2025-02-17 22:52:35,727 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:52:35,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144810 states to 0 states and 0 transitions. [2025-02-17 22:52:35,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:52:35,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:52:35,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:52:35,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:52:35,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:52:35,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:52:35,728 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:52:35,728 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:52:35,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:52:35,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:52:35,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:52:35,733 INFO L201 PluginConnector]: Adding new model pp5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:52:35 BoogieIcfgContainer [2025-02-17 22:52:35,733 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:52:35,734 INFO L158 Benchmark]: Toolchain (without parser) took 25107.28ms. Allocated memory was 159.4MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 84.7MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2025-02-17 22:52:35,734 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:52:35,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.60ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:52:35,734 INFO L158 Benchmark]: Boogie Preprocessor took 13.72ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.6MB in the end (delta: 743.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:52:35,734 INFO L158 Benchmark]: RCFGBuilder took 208.07ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 72.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-02-17 22:52:35,735 INFO L158 Benchmark]: BuchiAutomizer took 24862.69ms. Allocated memory was 159.4MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 72.8MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2025-02-17 22:52:35,735 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.28ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.60ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 83.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 13.72ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.6MB in the end (delta: 743.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 208.07ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 72.8MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 24862.69ms. Allocated memory was 159.4MB in the beginning and 6.3GB in the end (delta: 6.2GB). Free memory was 72.8MB in the beginning and 3.8GB in the end (delta: -3.8GB). Peak memory consumption was 2.4GB. 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 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z1 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 4.6s AutomataMinimizationTime, 4 MinimizatonAttempts, 13276 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 7.9s Buchi closure took 0.2s. 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, 412 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 296 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 282 IncrementalHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 251 mSDtfsCounter, 282 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 2.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 2717, Trivial Ample Sets caused by loops: 14611, Number of non-trivial ample sets: 22107, Number of pruned transitions: 17023, Number of transitions in reduction automaton: 36789, Number of states in reduction automaton: 10888, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:52:35,746 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...