/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:34,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:34,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:22:34,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:34,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:34,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:34,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:34,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:34,989 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:34,989 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:34,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:34,990 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:34,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:34,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:34,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:34,992 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:34,992 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:35,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:35,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:35,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:35,229 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:35,230 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:35,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-trans.wvr.bpl [2025-04-26 16:22:35,233 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-trans.wvr.bpl' [2025-04-26 16:22:35,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:35,253 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:35,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:35,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:35,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:35,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,278 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,288 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:35,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:35,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:35,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:35,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:35,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:35,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:35,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:35,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:35,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/1) ... [2025-04-26 16:22:35,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:35,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:35,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:35,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:22:35,366 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:35,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:35,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:35,367 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:35,368 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:22:35,411 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:35,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:35,550 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:35,550 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:35,597 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:35,597 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:22:35,598 INFO L201 PluginConnector]: Adding new model word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:35 BoogieIcfgContainer [2025-04-26 16:22:35,598 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:35,599 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:35,599 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:35,603 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:35,603 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:35,603 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:35" (1/2) ... [2025-04-26 16:22:35,604 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c8b53ef and model type word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:35, skipping insertion in model container [2025-04-26 16:22:35,604 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:35,605 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:35" (2/2) ... [2025-04-26 16:22:35,606 INFO L376 chiAutomizerObserver]: Analyzing ICFG word-trans.wvr.bpl [2025-04-26 16:22:35,646 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:35,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:22:35,697 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-26 16:22:35,700 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:35,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 34 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:22:35,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 16:22:35,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2025-04-26 16:22:35,709 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 25 transitions, 68 flow [2025-04-26 16:22:35,717 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:35,718 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:35,718 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:35,718 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:35,718 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:35,718 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:35,718 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:35,718 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:35,719 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:35,765 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:35,765 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:35,765 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:35,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:35,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:35,769 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:35,769 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 109 states, but on-demand construction may add more states [2025-04-26 16:22:35,775 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:35,775 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:35,775 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:35,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:35,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:35,779 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[117] $Ultimate##0-->L38: Formula: (and (not v_break_10_23) (= v_count_4_9 v_count_1_9) (= v_i_9_24 0)) InVars {count_4=v_count_4_9, count_1=v_count_1_9} OutVars{break_10=v_break_10_23, count_1=v_count_1_9, count_4=v_count_4_9, i_9=v_i_9_24} AuxVars[] AssignedVars[break_10, i_9]" [2025-04-26 16:22:35,779 INFO L754 eck$LassoCheckResult]: Loop: "[120] L38-->L38: Formula: (let ((.cse2 (not v_break_10_18)) (.cse0 (select v_array_0_9 v_i_9_19)) (.cse1 (select v_array_3_9 v_i_9_19))) (and (= (ite (< .cse0 .cse1) (- 1) (ite (< .cse1 .cse0) 1 v_result_11_18)) v_result_11_17) (< v_i_9_19 v_len_2_9) .cse2 (< v_i_9_19 v_len_5_9) (= (+ v_i_9_19 1) v_i_9_18) (let ((.cse3 (= .cse0 .cse1))) (or (and (or v_break_10_18 (not .cse3)) v_break_10_17) (and (not v_break_10_17) .cse2 .cse3))))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, array_3=v_array_3_9, array_0=v_array_0_9, len_2=v_len_2_9, len_5=v_len_5_9, i_9=v_i_9_19} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, array_3=v_array_3_9, array_0=v_array_0_9, len_2=v_len_2_9, len_5=v_len_5_9, i_9=v_i_9_18} AuxVars[] AssignedVars[break_10, result_11, i_9]" [2025-04-26 16:22:35,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash 5201, now seen corresponding path program 1 times [2025-04-26 16:22:35,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:35,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154888442] [2025-04-26 16:22:35,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:35,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:35,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:35,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:35,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:35,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:35,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:35,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,847 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2025-04-26 16:22:35,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:35,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527074662] [2025-04-26 16:22:35,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:35,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:35,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:35,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:35,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:35,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash 161351, now seen corresponding path program 1 times [2025-04-26 16:22:35,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:35,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688962100] [2025-04-26 16:22:35,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:35,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:35,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:35,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:35,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:35,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:35,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:36,155 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:36,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:36,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:36,156 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:36,156 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:36,156 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,156 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:36,156 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:36,156 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:36,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:36,156 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:36,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:36,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:36,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:36,515 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:36,517 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:36,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:36,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:22:36,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:36,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:36,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:36,542 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:36,546 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:36,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:22:36,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:36,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:22:36,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:36,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:36,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:36,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:36,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:36,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:36,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:36,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:36,597 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:36,597 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:36,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:36,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:36,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:36,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:22:36,602 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:36,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:22:36,622 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:36,623 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:36,623 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_2, i_9) = 1*len_2 - 1*i_9 Supporting invariants [] [2025-04-26 16:22:36,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:22:36,631 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:36,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:36,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:36,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:36,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:36,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:36,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:36,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:36,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:36,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:36,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:36,745 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:36,748 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 109 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:36,856 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 109 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 341 states and 1282 transitions. Complement of second has 5 states. [2025-04-26 16:22:36,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-26 16:22:36,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:36,869 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,869 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:36,870 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,870 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 58 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:36,870 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,870 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 1282 transitions. [2025-04-26 16:22:36,882 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 64 [2025-04-26 16:22:36,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 211 states and 775 transitions. [2025-04-26 16:22:36,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2025-04-26 16:22:36,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2025-04-26 16:22:36,892 INFO L74 IsDeterministic]: Start isDeterministic. Operand 211 states and 775 transitions. [2025-04-26 16:22:36,892 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:36,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 211 states and 775 transitions. [2025-04-26 16:22:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 775 transitions. [2025-04-26 16:22:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 132. [2025-04-26 16:22:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 4.0606060606060606) internal successors, (in total 536), 131 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 536 transitions. [2025-04-26 16:22:36,919 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 536 transitions. [2025-04-26 16:22:36,919 INFO L438 stractBuchiCegarLoop]: Abstraction has 132 states and 536 transitions. [2025-04-26 16:22:36,919 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:36,919 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 536 transitions. [2025-04-26 16:22:36,921 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:36,921 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:36,921 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:36,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:36,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:36,921 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[136] L121-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] $Ultimate##0-->L68: Formula: (and (= v_i_12_10 0) (= v_count_4_11 v_count_7_7) (not v_break_13_9)) InVars {count_7=v_count_7_7, count_4=v_count_4_11} OutVars{i_12=v_i_12_10, count_7=v_count_7_7, break_13=v_break_13_9, count_4=v_count_4_11} AuxVars[] AssignedVars[i_12, break_13]" [2025-04-26 16:22:36,921 INFO L754 eck$LassoCheckResult]: Loop: "[124] L68-->L68: Formula: (let ((.cse1 (select v_array_6_9 v_i_12_23)) (.cse0 (select v_array_3_15 v_i_12_23)) (.cse3 (not v_break_13_22))) (and (= v_result_14_17 (ite (< .cse0 .cse1) (- 1) (ite (< .cse1 .cse0) 1 v_result_14_18))) (let ((.cse2 (= .cse1 .cse0))) (or (and .cse2 (not v_break_13_21) .cse3) (and (or v_break_13_22 (not .cse2)) v_break_13_21))) (= (+ v_i_12_23 1) v_i_12_22) (< v_i_12_23 v_len_5_13) (< v_i_12_23 v_len_8_9) .cse3)) InVars {array_6=v_array_6_9, result_14=v_result_14_18, array_3=v_array_3_15, len_5=v_len_5_13, i_12=v_i_12_23, break_13=v_break_13_22, len_8=v_len_8_9} OutVars{array_6=v_array_6_9, result_14=v_result_14_17, array_3=v_array_3_15, len_5=v_len_5_13, i_12=v_i_12_22, break_13=v_break_13_21, len_8=v_len_8_9} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 16:22:36,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash 161941, now seen corresponding path program 1 times [2025-04-26 16:22:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:36,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452393734] [2025-04-26 16:22:36,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:36,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:36,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:36,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:36,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:36,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:36,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:36,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash 155, now seen corresponding path program 1 times [2025-04-26 16:22:36,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:36,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876272379] [2025-04-26 16:22:36,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:36,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:36,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:36,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:36,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:36,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:36,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:36,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash 5020295, now seen corresponding path program 1 times [2025-04-26 16:22:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:36,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488508271] [2025-04-26 16:22:36,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:36,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:36,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:36,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:36,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:36,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:36,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:37,105 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:37,106 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:37,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:37,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:37,106 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:37,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:37,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:37,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-trans.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:37,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:37,106 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:37,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,370 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:37,370 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:37,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:37,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:22:37,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:37,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:37,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:37,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:37,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:37,392 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:22:37,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,428 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:37,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:22:37,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:37,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:37,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:37,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:37,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:37,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:37,467 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:37,467 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:37,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:37,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:22:37,473 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:37,494 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-04-26 16:22:37,497 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:37,497 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:37,497 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_12, len_8) = -1*i_12 + 1*len_8 Supporting invariants [] [2025-04-26 16:22:37,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:22:37,505 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:37,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:37,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:37,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:37,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:37,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:37,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:37,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:37,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:37,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:37,539 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:37,539 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 536 transitions. cyclomatic complexity: 461 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:37,615 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 536 transitions. cyclomatic complexity: 461. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 411 states and 1655 transitions. Complement of second has 4 states. [2025-04-26 16:22:37,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-04-26 16:22:37,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:37,617 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:37,617 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:37,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:37,618 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:37,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:37,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 1655 transitions. [2025-04-26 16:22:37,629 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 32 [2025-04-26 16:22:37,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 243 states and 940 transitions. [2025-04-26 16:22:37,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2025-04-26 16:22:37,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2025-04-26 16:22:37,635 INFO L74 IsDeterministic]: Start isDeterministic. Operand 243 states and 940 transitions. [2025-04-26 16:22:37,635 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:37,635 INFO L218 hiAutomatonCegarLoop]: Abstraction has 243 states and 940 transitions. [2025-04-26 16:22:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 940 transitions. [2025-04-26 16:22:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 157. [2025-04-26 16:22:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 4.159235668789809) internal successors, (in total 653), 156 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 653 transitions. [2025-04-26 16:22:37,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 653 transitions. [2025-04-26 16:22:37,647 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 653 transitions. [2025-04-26 16:22:37,647 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:37,647 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 653 transitions. [2025-04-26 16:22:37,648 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:37,648 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:37,648 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:37,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:37,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:37,649 INFO L752 eck$LassoCheckResult]: Stem: "[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[136] L121-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[139] L122-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[126] $Ultimate##0-->L98: Formula: (and (= v_i_15_10 0) (not v_break_16_9) (= v_count_1_11 v_count_7_11)) InVars {count_7=v_count_7_11, count_1=v_count_1_11} OutVars{count_7=v_count_7_11, count_1=v_count_1_11, i_15=v_i_15_10, break_16=v_break_16_9} AuxVars[] AssignedVars[i_15, break_16]" [2025-04-26 16:22:37,649 INFO L754 eck$LassoCheckResult]: Loop: "[129] L98-->L98: Formula: (let ((.cse2 (not v_break_16_22)) (.cse0 (select v_array_0_15 v_i_15_23)) (.cse1 (select v_array_6_15 v_i_15_23))) (and (= (ite (< .cse0 .cse1) (- 1) (ite (< .cse1 .cse0) 1 v_result_17_18)) v_result_17_17) (= (+ v_i_15_23 1) v_i_15_22) (< v_i_15_23 v_len_8_13) .cse2 (< v_i_15_23 v_len_2_13) (let ((.cse3 (= .cse0 .cse1))) (or (and (or (not .cse3) v_break_16_22) v_break_16_21) (and .cse2 (not v_break_16_21) .cse3))))) InVars {array_6=v_array_6_15, i_15=v_i_15_23, array_0=v_array_0_15, result_17=v_result_17_18, len_2=v_len_2_13, len_8=v_len_8_13, break_16=v_break_16_22} OutVars{array_6=v_array_6_15, i_15=v_i_15_22, array_0=v_array_0_15, result_17=v_result_17_17, len_2=v_len_2_13, len_8=v_len_8_13, break_16=v_break_16_21} AuxVars[] AssignedVars[i_15, result_17, break_16]" [2025-04-26 16:22:37,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash 5020855, now seen corresponding path program 1 times [2025-04-26 16:22:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:37,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123503321] [2025-04-26 16:22:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:37,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:37,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:37,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:37,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:37,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:37,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:37,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:37,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:37,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:37,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2025-04-26 16:22:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:37,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152600394] [2025-04-26 16:22:37,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:37,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:37,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:37,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:37,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:37,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:37,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:37,673 INFO L85 PathProgramCache]: Analyzing trace with hash 155646634, now seen corresponding path program 1 times [2025-04-26 16:22:37,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:37,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779282723] [2025-04-26 16:22:37,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:37,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:37,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:37,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:37,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:37,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:37,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:37,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:37,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:37,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:37,841 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:37,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:37,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:37,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:37,841 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:37,841 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,841 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:37,841 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:37,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:37,841 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:37,841 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:37,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:38,106 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:38,106 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:38,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:38,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:22:38,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:38,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:38,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:38,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:38,123 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:38,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:22:38,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:38,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:22:38,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:38,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:38,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:38,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:38,145 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:38,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:22:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,152 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:38,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:22:38,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:38,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:38,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:38,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:38,168 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:38,174 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-04-26 16:22:38,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:38,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:22:38,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:38,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,205 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:38,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,218 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:22:38,218 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:38,247 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:38,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:22:38,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:38,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:22:38,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:38,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:38,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:38,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:38,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:38,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:38,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:38,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:38,280 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:22:38,280 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:38,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:38,282 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:38,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:22:38,284 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:38,299 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-04-26 16:22:38,299 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:38,299 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:38,299 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_8, i_15) = 1*len_8 - 1*i_15 Supporting invariants [] [2025-04-26 16:22:38,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:22:38,305 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:38,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:38,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:38,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:38,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:38,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:38,333 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:22:38,333 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 653 transitions. cyclomatic complexity: 550 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:38,378 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 653 transitions. cyclomatic complexity: 550. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 329 states and 1307 transitions. Complement of second has 4 states. [2025-04-26 16:22:38,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 16:22:38,379 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:38,379 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,379 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:22:38,380 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,380 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:38,380 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 1307 transitions. [2025-04-26 16:22:38,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:38,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2025-04-26 16:22:38,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:38,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:38,385 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:38,385 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:38,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:38,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:38,385 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:38,385 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:38,385 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:38,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:38,385 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:38,390 INFO L201 PluginConnector]: Adding new model word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:38 BoogieIcfgContainer [2025-04-26 16:22:38,390 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:38,391 INFO L158 Benchmark]: Toolchain (without parser) took 3138.33ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 94.9MB in the beginning and 79.8MB in the end (delta: 15.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:38,392 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:38,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.28ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 93.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:38,393 INFO L158 Benchmark]: Boogie Preprocessor took 31.12ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:38,393 INFO L158 Benchmark]: RCFGBuilder took 277.00ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 77.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:22:38,393 INFO L158 Benchmark]: BuchiAutomizer took 2791.73ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 77.8MB in the beginning and 79.8MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:38,394 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.71ms. Allocated memory is still 167.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.28ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 93.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.12ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 91.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 277.00ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 77.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2791.73ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 77.8MB in the beginning and 79.8MB in the end (delta: -2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 165 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 20 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp200 ukn38 mio100 lsp75 div100 bol108 ite100 ukn100 eq148 hnf100 smp100 dnf503 smp13 tf100 neg100 sie118 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 73ms VariablesStem: 1 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i_9 + len_2 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_12 + len_8 and consists of 3 locations. One deterministic module has affine ranking function -1 * i_15 + len_8 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:22:38,410 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...