/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/name-comparator-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:20,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:20,534 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:20,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:20,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:20,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:20,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:20,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:20,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:20,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:20,563 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:20,564 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:20,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:20,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:20,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:20,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:20,566 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:20,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:20,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:20,566 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:20,567 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:20,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:20,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:20,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:20,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:20,567 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:20,567 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:20,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:20,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:20,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:20,817 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:20,817 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:20,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-subst.wvr.bpl [2025-04-26 16:22:20,820 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/name-comparator-subst.wvr.bpl' [2025-04-26 16:22:20,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:20,851 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:20,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:20,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:20,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:20,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,889 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:20,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:20,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:20,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:20,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:20,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,904 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:20,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:20,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:20,924 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:20,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/1) ... [2025-04-26 16:22:20,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:20,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:20,950 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:20,953 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:20,971 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:20,971 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:20,971 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:20,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:20,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:20,971 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:20,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:20,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:20,972 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:21,009 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:21,011 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:21,158 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:21,158 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:21,231 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:21,231 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:22:21,232 INFO L201 PluginConnector]: Adding new model name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:21 BoogieIcfgContainer [2025-04-26 16:22:21,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:21,232 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:21,232 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:21,238 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:21,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:21,239 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:20" (1/2) ... [2025-04-26 16:22:21,240 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2650a037 and model type name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:21, skipping insertion in model container [2025-04-26 16:22:21,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:21,240 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:21" (2/2) ... [2025-04-26 16:22:21,241 INFO L376 chiAutomizerObserver]: Analyzing ICFG name-comparator-subst.wvr.bpl [2025-04-26 16:22:21,295 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:21,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:22:21,345 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:22:21,347 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:21,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:22:21,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:22:21,354 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 16:22:21,355 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 16:22:21,362 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:21,362 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:21,362 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:21,362 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:21,362 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:21,363 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:21,363 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:21,363 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:21,364 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:21,413 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:21,414 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:21,414 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:21,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:21,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:21,416 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:21,417 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 109 states, but on-demand construction may add more states [2025-04-26 16:22:21,422 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 53 [2025-04-26 16:22:21,422 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:21,422 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:21,422 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:21,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:21,427 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[116] $Ultimate##0-->L36: Formula: (let ((.cse0 (not v_break_7_62)) (.cse1 (= v_name_1_15 v_name_2_15))) (and (= v_i_5_7 0) .cse0 (= (ite .cse1 0 v_result_4_19) v_result_4_18) (or (and (or .cse1 v_break_7_62) v_break_7_20) (and .cse0 (not .cse1) (not v_break_7_20))))) InVars {result_4=v_result_4_19, name_2=v_name_2_15, name_1=v_name_1_15} OutVars{name_2=v_name_2_15, i_5=v_i_5_7, result_4=v_result_4_18, break_7=v_break_7_20, name_1=v_name_1_15} AuxVars[v_break_7_62] AssignedVars[i_5, result_4, break_7]" [2025-04-26 16:22:21,428 INFO L754 eck$LassoCheckResult]: Loop: "[118] L36-->L36: Formula: (let ((.cse3 (= v_name_2_29 v_current_6_16)) (.cse1 (not v_break_7_64))) (let ((.cse4 (and .cse3 .cse1)) (.cse0 (= v_name_1_25 v_current_6_16)) (.cse2 (not v_break_7_53))) (and (= v_current_6_16 (select v_nondet_0_6 v_i_5_32)) (< v_i_5_32 3) (= v_i_5_31 (+ v_i_5_32 1)) (or (and (or .cse0 v_break_7_53) v_break_7_64) (and (not .cse0) .cse1 .cse2)) (or (and (not v_break_7_52) (or v_break_7_64 (not .cse3)) .cse1) (and (or v_break_7_64 .cse4) v_break_7_52)) (= v_result_4_44 (ite .cse4 (- 1) (ite .cse0 1 v_result_4_45))) .cse2))) InVars {name_2=v_name_2_29, i_5=v_i_5_32, nondet_0=v_nondet_0_6, result_4=v_result_4_45, break_7=v_break_7_53, name_1=v_name_1_25} OutVars{name_2=v_name_2_29, i_5=v_i_5_31, result_4=v_result_4_44, break_7=v_break_7_52, current_6=v_current_6_16, name_1=v_name_1_25, nondet_0=v_nondet_0_6} AuxVars[v_break_7_64] AssignedVars[i_5, result_4, break_7, current_6]" [2025-04-26 16:22:21,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash 5107, now seen corresponding path program 1 times [2025-04-26 16:22:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246539172] [2025-04-26 16:22:21,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:21,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:21,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:21,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:21,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:21,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2025-04-26 16:22:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075727472] [2025-04-26 16:22:21,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:21,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:21,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:21,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:21,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:21,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 158435, now seen corresponding path program 1 times [2025-04-26 16:22:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:21,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141048931] [2025-04-26 16:22:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:21,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:21,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:21,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:21,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:21,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:21,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:21,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:22,047 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:22,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:22,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:22,047 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:22,048 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:22,048 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:22,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:22,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:22,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:22,049 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:22,049 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:22,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:22,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:22,334 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:22,631 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:22,634 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:22,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:22,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:22,637 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:22,638 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:22,640 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:22,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:22,651 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:22,651 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 16:22:22,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:22,769 INFO L402 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2025-04-26 16:22:22,769 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 16:22:22,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:22,951 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:22,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:22,953 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:22,954 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:22,955 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:22,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:22,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:22,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:22,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:22,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:22,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:22,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:22,977 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:22,977 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:22:22,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:22,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:22,982 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:22,982 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:22,983 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:23,002 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:23,002 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:23,002 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:23,003 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_5) = -2*i_5 + 5 Supporting invariants [] [2025-04-26 16:22:23,008 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:23,010 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:23,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:23,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:23,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:23,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:23,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:23,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:23,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:23,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:23,065 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:23,086 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:23,088 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:23,176 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 275 states and 936 transitions. Complement of second has 5 states. [2025-04-26 16:22:23,177 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:23,180 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:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:22:23,188 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:22:23,189 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,189 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:23,189 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,189 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:23,189 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 275 states and 936 transitions. [2025-04-26 16:22:23,200 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:23,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 275 states to 163 states and 563 transitions. [2025-04-26 16:22:23,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-04-26 16:22:23,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2025-04-26 16:22:23,209 INFO L74 IsDeterministic]: Start isDeterministic. Operand 163 states and 563 transitions. [2025-04-26 16:22:23,209 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:23,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 163 states and 563 transitions. [2025-04-26 16:22:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states and 563 transitions. [2025-04-26 16:22:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 132. [2025-04-26 16:22:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 3.5606060606060606) internal successors, (in total 470), 131 states have internal predecessors, (470), 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:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 470 transitions. [2025-04-26 16:22:23,236 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132 states and 470 transitions. [2025-04-26 16:22:23,236 INFO L438 stractBuchiCegarLoop]: Abstraction has 132 states and 470 transitions. [2025-04-26 16:22:23,236 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:23,236 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 470 transitions. [2025-04-26 16:22:23,238 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 40 [2025-04-26 16:22:23,238 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,238 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:23,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:23,239 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[133] L107-->$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]" "[120] $Ultimate##0-->L62: Formula: (let ((.cse0 (not v_break_11_52)) (.cse1 (= v_name_3_15 v_name_1_35))) (and (= v_i_9_11 0) .cse0 (= v_result_8_26 (ite .cse1 0 v_result_8_27)) (or (and (not v_break_11_22) (not .cse1) .cse0) (and (or .cse1 v_break_11_52) v_break_11_22)))) InVars {name_3=v_name_3_15, result_8=v_result_8_27, name_1=v_name_1_35} OutVars{name_3=v_name_3_15, result_8=v_result_8_26, break_11=v_break_11_22, name_1=v_name_1_35, i_9=v_i_9_11} AuxVars[v_break_11_52] AssignedVars[result_8, break_11, i_9]" [2025-04-26 16:22:23,239 INFO L754 eck$LassoCheckResult]: Loop: "[122] L62-->L62: Formula: (let ((.cse2 (not v_break_11_54)) (.cse3 (= v_name_3_25 v_current_10_16))) (let ((.cse0 (and .cse2 .cse3)) (.cse1 (= v_name_1_41 v_current_10_16)) (.cse4 (not v_break_11_43))) (and (= v_i_9_27 (+ v_i_9_28 1)) (= v_result_8_42 (ite .cse0 (- 1) (ite .cse1 1 v_result_8_44))) (< v_i_9_28 3) (or (and (or .cse0 v_break_11_54) v_break_11_42) (and (not v_break_11_42) .cse2 (or (not .cse3) v_break_11_54))) (= v_current_10_16 (select v_nondet_0_12 v_i_9_28)) (or (and (not .cse1) .cse2 .cse4) (and (or .cse1 v_break_11_43) v_break_11_54)) .cse4))) InVars {name_3=v_name_3_25, result_8=v_result_8_44, break_11=v_break_11_43, nondet_0=v_nondet_0_12, name_1=v_name_1_41, i_9=v_i_9_28} OutVars{name_3=v_name_3_25, result_8=v_result_8_42, break_11=v_break_11_42, current_10=v_current_10_16, name_1=v_name_1_41, nondet_0=v_nondet_0_12, i_9=v_i_9_27} AuxVars[v_break_11_54] AssignedVars[result_8, break_11, current_10, i_9]" [2025-04-26 16:22:23,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 158964, now seen corresponding path program 1 times [2025-04-26 16:22:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32235326] [2025-04-26 16:22:23,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:23,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:23,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:23,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:23,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2025-04-26 16:22:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143620009] [2025-04-26 16:22:23,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:23,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:23,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:23,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash 4928006, now seen corresponding path program 1 times [2025-04-26 16:22:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423178041] [2025-04-26 16:22:23,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:23,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:23,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:23,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,563 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:23,563 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:23,563 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:23,564 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:23,564 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:23,564 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,564 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:23,564 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:23,564 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:23,564 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:23,564 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:23,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,759 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:24,035 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:24,035 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,040 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:24,041 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:24,042 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:24,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,055 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,061 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:24,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,063 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:24,064 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:24,065 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:24,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,080 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:24,085 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:24,085 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:24,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,088 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:24,090 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:24,090 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:24,107 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:24,107 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:24,107 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:24,107 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9) = -2*i_9 + 5 Supporting invariants [] [2025-04-26 16:22:24,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,114 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:24,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:24,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:24,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:24,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:24,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:24,143 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:24,143 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:24,143 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132 states and 470 transitions. cyclomatic complexity: 395 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:24,190 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132 states and 470 transitions. cyclomatic complexity: 395. 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 363 states and 1358 transitions. Complement of second has 4 states. [2025-04-26 16:22:24,191 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:24,191 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:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-26 16:22:24,191 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:22:24,191 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,192 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:24,192 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,192 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:24,192 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:24,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 363 states and 1358 transitions. [2025-04-26 16:22:24,197 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:24,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 363 states to 195 states and 733 transitions. [2025-04-26 16:22:24,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2025-04-26 16:22:24,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2025-04-26 16:22:24,200 INFO L74 IsDeterministic]: Start isDeterministic. Operand 195 states and 733 transitions. [2025-04-26 16:22:24,200 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:24,201 INFO L218 hiAutomatonCegarLoop]: Abstraction has 195 states and 733 transitions. [2025-04-26 16:22:24,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 733 transitions. [2025-04-26 16:22:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2025-04-26 16:22:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 3.8089171974522293) internal successors, (in total 598), 156 states have internal predecessors, (598), 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:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 598 transitions. [2025-04-26 16:22:24,215 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 598 transitions. [2025-04-26 16:22:24,215 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 598 transitions. [2025-04-26 16:22:24,215 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:24,215 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 598 transitions. [2025-04-26 16:22:24,216 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 16:22:24,216 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:24,216 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:24,217 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:24,217 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:22:24,217 INFO L752 eck$LassoCheckResult]: Stem: "[130] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[133] L107-->$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]" "[136] L108-->$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]" "[124] $Ultimate##0-->L88: Formula: (let ((.cse0 (not v_break_15_62)) (.cse1 (= v_name_3_43 v_name_2_43))) (and .cse0 (= v_i_13_31 0) (= v_result_12_40 (ite .cse1 0 v_result_12_41)) (or (and (not .cse1) .cse0 (not v_break_15_52)) (and (or .cse1 v_break_15_62) v_break_15_52)))) InVars {name_3=v_name_3_43, result_12=v_result_12_41, name_2=v_name_2_43} OutVars{name_3=v_name_3_43, result_12=v_result_12_40, name_2=v_name_2_43, i_13=v_i_13_31, break_15=v_break_15_52} AuxVars[v_break_15_62] AssignedVars[result_12, i_13, break_15]" [2025-04-26 16:22:24,217 INFO L754 eck$LassoCheckResult]: Loop: "[125] L88-->L88: Formula: (let ((.cse3 (not v_break_15_64)) (.cse4 (= v_name_3_37 v_current_14_16))) (let ((.cse0 (and .cse3 .cse4)) (.cse1 (= v_name_2_37 v_current_14_16)) (.cse2 (not v_break_15_39))) (and (= v_result_12_28 (ite .cse0 (- 1) (ite .cse1 1 v_result_12_29))) (< v_i_13_28 3) .cse2 (or (and (not v_break_15_38) .cse3 (or (not .cse4) v_break_15_64)) (and (or v_break_15_64 .cse0) v_break_15_38)) (= (+ v_i_13_28 1) v_i_13_27) (= v_current_14_16 (select v_nondet_0_16 v_i_13_28)) (or (and (or .cse1 v_break_15_39) v_break_15_64) (and (not .cse1) .cse2 .cse3))))) InVars {name_3=v_name_3_37, result_12=v_result_12_29, name_2=v_name_2_37, i_13=v_i_13_28, nondet_0=v_nondet_0_16, break_15=v_break_15_39} OutVars{name_3=v_name_3_37, result_12=v_result_12_28, name_2=v_name_2_37, current_14=v_current_14_16, i_13=v_i_13_27, nondet_0=v_nondet_0_16, break_15=v_break_15_38} AuxVars[v_break_15_64] AssignedVars[result_12, current_14, i_13, break_15]" [2025-04-26 16:22:24,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash 4928504, now seen corresponding path program 1 times [2025-04-26 16:22:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138915130] [2025-04-26 16:22:24,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:24,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:24,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:24,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:24,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,226 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2025-04-26 16:22:24,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73038877] [2025-04-26 16:22:24,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:24,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:24,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:24,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:24,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 152783749, now seen corresponding path program 1 times [2025-04-26 16:22:24,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:24,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089443628] [2025-04-26 16:22:24,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:24,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:24,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:24,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:24,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:24,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:24,493 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:24,493 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:24,493 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:24,493 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:24,493 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:24,493 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,493 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:24,493 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:24,493 INFO L132 ssoRankerPreferences]: Filename of dumped script: name-comparator-subst.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:22:24,493 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:24,493 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:24,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,694 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:22:25,003 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:25,003 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,006 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:25,007 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:25,009 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:25,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:25,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:25,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:25,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:25,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:25,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:25,022 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:25,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:25,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,030 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:25,031 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:25,033 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:25,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:25,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:25,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:25,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:25,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:25,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:25,046 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:25,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:25,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,054 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:25,055 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:25,056 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:25,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:25,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:25,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:25,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:25,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:25,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:25,072 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:25,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:22:25,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,080 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:25,081 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:25,083 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:25,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:25,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:25,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:25,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:25,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:25,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:25,096 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:25,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:25,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,103 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:25,104 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:25,105 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:25,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:25,115 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:25,115 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2025-04-26 16:22:25,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:25,178 INFO L402 nArgumentSynthesizer]: We have 154 Motzkin's Theorem applications. [2025-04-26 16:22:25,178 INFO L403 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2025-04-26 16:22:25,323 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:25,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:22:25,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,334 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:25,335 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:25,337 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:25,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:25,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:25,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:25,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:25,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:25,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:25,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:25,357 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:25,357 INFO L437 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:25,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:25,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:25,359 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:22:25,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:22:25,362 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:25,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:22:25,376 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:25,376 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:25,377 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 5 Supporting invariants [] [2025-04-26 16:22:25,381 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:25,382 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:25,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:25,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:25,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:22:25,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:22:25,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,408 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:25,409 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:25,409 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157 states and 598 transitions. cyclomatic complexity: 495 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:25,445 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157 states and 598 transitions. cyclomatic complexity: 495. 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 1186 transitions. Complement of second has 4 states. [2025-04-26 16:22:25,445 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:25,446 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:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 16:22:25,446 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:22:25,446 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,446 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:22:25,446 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,446 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:25,446 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 1186 transitions. [2025-04-26 16:22:25,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:25,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2025-04-26 16:22:25,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:25,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:25,450 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:25,450 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:25,450 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:25,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:25,450 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:25,450 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:25,450 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:25,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:25,450 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:25,459 INFO L201 PluginConnector]: Adding new model name-comparator-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:25 BoogieIcfgContainer [2025-04-26 16:22:25,459 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:25,459 INFO L158 Benchmark]: Toolchain (without parser) took 4608.69ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 88.1MB in the beginning and 92.6MB in the end (delta: -4.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,459 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.73ms. Allocated memory is still 159.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.25ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 86.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,460 INFO L158 Benchmark]: Boogie Preprocessor took 32.04ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,460 INFO L158 Benchmark]: RCFGBuilder took 307.40ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 66.8MB in the end (delta: 18.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 16:22:25,460 INFO L158 Benchmark]: BuchiAutomizer took 4226.53ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 66.7MB in the beginning and 92.6MB in the end (delta: -25.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:25,461 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.73ms. Allocated memory is still 159.4MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.25ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 86.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 32.04ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 307.40ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 66.8MB in the end (delta: 18.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 4226.53ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 66.7MB in the beginning and 92.6MB in the end (delta: -25.9MB). 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 4.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 69 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, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 16 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp218 ukn46 mio100 lsp88 div100 bol112 ite100 ukn100 eq179 hnf99 smp100 dnf606 smp22 tf100 neg100 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 308ms VariablesStem: 5 VariablesLoop: 8 DisjunctsStem: 3 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 154 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 -2 * i_5 + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_9 + 5 and consists of 3 locations. One deterministic module has affine ranking function 5 + -2 * i_13 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:25,478 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...