/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:44,995 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:45,047 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:13:45,066 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:45,066 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:45,067 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:45,068 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:45,068 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:45,068 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:45,068 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:45,069 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:45,069 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:45,069 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:45,070 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:45,070 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:45,070 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:45,071 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:45,071 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:45,071 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:45,071 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:45,072 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:45,072 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:45,073 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:45,073 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:45,073 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:45,074 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:45,074 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:45,074 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:45,074 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:45,075 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:45,075 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:45,075 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:45,076 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:45,077 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:45,077 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:13:45,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:45,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:45,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:45,295 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:45,296 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:45,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl [2023-10-12 17:13:45,297 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring-nondet.wvr.bpl' [2023-10-12 17:13:45,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:45,339 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:45,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:45,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:45,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:45,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,362 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:45,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:45,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:45,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:45,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:45,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:45,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:45,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:45,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:45,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/1) ... [2023-10-12 17:13:45,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:45,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:45,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:13:45,466 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:45,467 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:45,467 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:45,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:45,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:45,472 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:45,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:45,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:45,472 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:13:45,473 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:13:45,473 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:13:45,474 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:13:45,532 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:45,536 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:45,653 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:45,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:45,696 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:13:45,698 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:45 BoogieIcfgContainer [2023-10-12 17:13:45,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:45,699 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:45,699 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:45,707 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:45,707 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:45,707 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:45" (1/2) ... [2023-10-12 17:13:45,709 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f6373f5 and model type ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:45, skipping insertion in model container [2023-10-12 17:13:45,709 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:45,709 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:45" (2/2) ... [2023-10-12 17:13:45,710 INFO L332 chiAutomizerObserver]: Analyzing ICFG ring-nondet.wvr.bpl [2023-10-12 17:13:45,788 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:13:45,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:13:45,830 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:13:45,830 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:45,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:13:45,834 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:13:45,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2023-10-12 17:13:45,841 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:45,853 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:13:45,855 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:13:45,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 78 flow [2023-10-12 17:13:45,864 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:13:45,864 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:13:45,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-10-12 17:13:45,866 INFO L119 LiptonReduction]: Number of co-enabled transitions 314 [2023-10-12 17:13:46,574 INFO L134 LiptonReduction]: Checked pairs total: 304 [2023-10-12 17:13:46,575 INFO L136 LiptonReduction]: Total number of compositions: 16 [2023-10-12 17:13:46,594 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:46,594 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:46,594 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:46,595 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:46,595 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:46,595 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:46,595 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:46,595 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:46,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:46,631 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:13:46,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:46,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:46,635 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:46,635 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:46,635 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:46,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 24 states, but on-demand construction may add more states [2023-10-12 17:13:46,638 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:13:46,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:46,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:46,639 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:46,639 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:46,642 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L95-1, L41]don't care [2023-10-12 17:13:46,643 INFO L750 eck$LassoCheckResult]: Loop: 48#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 48#[L95-1, L41]don't care [2023-10-12 17:13:46,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,647 INFO L85 PathProgramCache]: Analyzing trace with hash 4057, now seen corresponding path program 1 times [2023-10-12 17:13:46,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625657572] [2023-10-12 17:13:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:46,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash 163, now seen corresponding path program 1 times [2023-10-12 17:13:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201964915] [2023-10-12 17:13:46,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:46,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash 125899, now seen corresponding path program 1 times [2023-10-12 17:13:46,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132324173] [2023-10-12 17:13:46,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,068 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:47,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:47,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:47,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:47,069 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:47,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:47,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:47,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:13:47,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:47,072 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:47,098 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,106 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,109 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,114 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,117 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,119 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,126 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,417 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2023-10-12 17:13:47,583 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:47,587 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:47,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:13:47,631 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 [2023-10-12 17:13:47,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,645 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,645 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:13:47,684 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 [2023-10-12 17:13:47,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:13:47,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:13:47,728 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 [2023-10-12 17:13:47,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,769 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,777 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:13:47,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:47,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,823 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,830 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 [2023-10-12 17:13:47,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,842 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:13:47,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:13:47,859 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 [2023-10-12 17:13:47,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,873 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:13:47,916 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 [2023-10-12 17:13:47,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,924 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:47,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,958 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:47,958 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:48,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:48,046 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:13:48,047 INFO L444 ModelExtractionUtils]: 44 out of 56 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:13:48,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,055 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:13:48,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:48,117 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-10-12 17:13:48,117 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:48,118 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i, q3_back, q3_front) = 1*N - 1*i + 1*q3_back - 1*q3_front Supporting invariants [1*q3_back - 1*q3_front >= 0] [2023-10-12 17:13:48,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,132 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:13:48,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,210 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:48,235 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2023-10-12 17:13:48,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 24 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,336 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 24 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 84 states and 237 transitions. Complement of second has 7 states. [2023-10-12 17:13:48,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:48,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-10-12 17:13:48,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:13:48,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:13:48,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:13:48,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 237 transitions. [2023-10-12 17:13:48,353 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 19 [2023-10-12 17:13:48,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 52 states and 158 transitions. [2023-10-12 17:13:48,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-10-12 17:13:48,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-10-12 17:13:48,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 158 transitions. [2023-10-12 17:13:48,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:48,360 INFO L219 hiAutomatonCegarLoop]: Abstraction has 52 states and 158 transitions. [2023-10-12 17:13:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 158 transitions. [2023-10-12 17:13:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 33. [2023-10-12 17:13:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 32 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 103 transitions. [2023-10-12 17:13:48,392 INFO L241 hiAutomatonCegarLoop]: Abstraction has 33 states and 103 transitions. [2023-10-12 17:13:48,392 INFO L430 stractBuchiCegarLoop]: Abstraction has 33 states and 103 transitions. [2023-10-12 17:13:48,393 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:48,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 103 transitions. [2023-10-12 17:13:48,394 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:13:48,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:48,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:48,395 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:48,395 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:48,395 INFO L748 eck$LassoCheckResult]: Stem: 280#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 260#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 262#[L95-1, L41]don't care [123] L95-1-->L58: 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] 218#[L96, L41, L58]don't care [2023-10-12 17:13:48,395 INFO L750 eck$LassoCheckResult]: Loop: 218#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 218#[L96, L41, L58]don't care [2023-10-12 17:13:48,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 125890, now seen corresponding path program 1 times [2023-10-12 17:13:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066401178] [2023-10-12 17:13:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 1 times [2023-10-12 17:13:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675178049] [2023-10-12 17:13:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash 3902735, now seen corresponding path program 1 times [2023-10-12 17:13:48,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710079639] [2023-10-12 17:13:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:48,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:48,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710079639] [2023-10-12 17:13:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710079639] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:48,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871438188] [2023-10-12 17:13:48,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:48,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:48,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:48,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:48,599 INFO L87 Difference]: Start difference. First operand 33 states and 103 transitions. cyclomatic complexity: 91 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:48,628 INFO L93 Difference]: Finished difference Result 47 states and 138 transitions. [2023-10-12 17:13:48,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 138 transitions. [2023-10-12 17:13:48,630 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 17 [2023-10-12 17:13:48,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 138 transitions. [2023-10-12 17:13:48,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-10-12 17:13:48,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-10-12 17:13:48,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 138 transitions. [2023-10-12 17:13:48,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:48,632 INFO L219 hiAutomatonCegarLoop]: Abstraction has 47 states and 138 transitions. [2023-10-12 17:13:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 138 transitions. [2023-10-12 17:13:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2023-10-12 17:13:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 3.073170731707317) internal successors, (126), 40 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 126 transitions. [2023-10-12 17:13:48,637 INFO L241 hiAutomatonCegarLoop]: Abstraction has 41 states and 126 transitions. [2023-10-12 17:13:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:48,638 INFO L430 stractBuchiCegarLoop]: Abstraction has 41 states and 126 transitions. [2023-10-12 17:13:48,638 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:48,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 126 transitions. [2023-10-12 17:13:48,639 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 16 [2023-10-12 17:13:48,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:48,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:48,640 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:48,640 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:48,640 INFO L748 eck$LassoCheckResult]: Stem: 411#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 383#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 385#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 405#[L95-1, L41]don't care [123] L95-1-->L58: 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] 407#[L96, L41, L58]don't care [2023-10-12 17:13:48,641 INFO L750 eck$LassoCheckResult]: Loop: 407#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 407#[L96, L41, L58]don't care [2023-10-12 17:13:48,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash 3902992, now seen corresponding path program 1 times [2023-10-12 17:13:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475917427] [2023-10-12 17:13:48,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 2 times [2023-10-12 17:13:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45518986] [2023-10-12 17:13:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash 120992897, now seen corresponding path program 1 times [2023-10-12 17:13:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736922594] [2023-10-12 17:13:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:48,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:48,940 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:48,941 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:48,941 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:48,941 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:48,941 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:48,941 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,941 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:48,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:48,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:13:48,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:48,941 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:48,946 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:48,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:48,954 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:48,962 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,024 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,029 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,036 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,039 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,043 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,045 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,279 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:49,279 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:49,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,285 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:13:49,298 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 [2023-10-12 17:13:49,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,308 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:49,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:13:49,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,321 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,351 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 [2023-10-12 17:13:49,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:13:49,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:49,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:49,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:49,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,396 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,414 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 [2023-10-12 17:13:49,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:13:49,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,423 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,423 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:49,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:49,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,452 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:13:49,456 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 [2023-10-12 17:13:49,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,465 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:49,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:49,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,493 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,508 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 [2023-10-12 17:13:49,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:13:49,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:49,558 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:13:49,558 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:13:49,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,560 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:13:49,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:49,597 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:49,597 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:49,597 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2023-10-12 17:13:49,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:49,604 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:49,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:49,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:49,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:49,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:49,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:49,637 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 [2023-10-12 17:13:49,637 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 126 transitions. cyclomatic complexity: 107 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:49,681 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 126 transitions. cyclomatic complexity: 107. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 119 states and 348 transitions. Complement of second has 5 states. [2023-10-12 17:13:49,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2023-10-12 17:13:49,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:13:49,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:13:49,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:49,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 348 transitions. [2023-10-12 17:13:49,695 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 23 [2023-10-12 17:13:49,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 95 states and 288 transitions. [2023-10-12 17:13:49,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-10-12 17:13:49,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2023-10-12 17:13:49,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 288 transitions. [2023-10-12 17:13:49,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:49,698 INFO L219 hiAutomatonCegarLoop]: Abstraction has 95 states and 288 transitions. [2023-10-12 17:13:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 288 transitions. [2023-10-12 17:13:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 63. [2023-10-12 17:13:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 3.2698412698412698) internal successors, (206), 62 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 206 transitions. [2023-10-12 17:13:49,706 INFO L241 hiAutomatonCegarLoop]: Abstraction has 63 states and 206 transitions. [2023-10-12 17:13:49,706 INFO L430 stractBuchiCegarLoop]: Abstraction has 63 states and 206 transitions. [2023-10-12 17:13:49,706 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:49,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 206 transitions. [2023-10-12 17:13:49,707 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2023-10-12 17:13:49,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:49,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:49,707 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:49,707 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:49,710 INFO L748 eck$LassoCheckResult]: Stem: 660#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 620#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 622#[L95-1, L41]don't care [123] L95-1-->L58: 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] 574#[L96, L41, L58]don't care [142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 580#[L96, thread1EXIT, L58]don't care [2023-10-12 17:13:49,711 INFO L750 eck$LassoCheckResult]: Loop: 580#[L96, thread1EXIT, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 580#[L96, thread1EXIT, L58]don't care [2023-10-12 17:13:49,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash 3902732, now seen corresponding path program 1 times [2023-10-12 17:13:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947927402] [2023-10-12 17:13:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 3 times [2023-10-12 17:13:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492235380] [2023-10-12 17:13:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 120984837, now seen corresponding path program 1 times [2023-10-12 17:13:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637001249] [2023-10-12 17:13:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,946 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:49,947 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:49,947 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:49,947 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:49,947 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:49,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:49,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:49,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:13:49,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:49,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:49,950 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,952 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,954 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,014 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,017 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,020 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,025 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,027 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,033 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,036 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:50,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:50,233 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,237 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,253 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 [2023-10-12 17:13:50,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:13:50,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,273 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:13:50,276 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 [2023-10-12 17:13:50,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,294 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:13:50,299 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 [2023-10-12 17:13:50,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,307 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,308 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,318 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:50,324 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:13:50,324 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:13:50,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,337 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:50,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:13:50,356 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:50,356 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:50,356 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2023-10-12 17:13:50,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,364 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:50,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:50,397 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 [2023-10-12 17:13:50,397 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 206 transitions. cyclomatic complexity: 177 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,428 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 206 transitions. cyclomatic complexity: 177. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 309 transitions. Complement of second has 4 states. [2023-10-12 17:13:50,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2023-10-12 17:13:50,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:13:50,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:13:50,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:50,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 309 transitions. [2023-10-12 17:13:50,438 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:13:50,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 74 states and 231 transitions. [2023-10-12 17:13:50,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2023-10-12 17:13:50,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2023-10-12 17:13:50,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 231 transitions. [2023-10-12 17:13:50,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:50,443 INFO L219 hiAutomatonCegarLoop]: Abstraction has 74 states and 231 transitions. [2023-10-12 17:13:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 231 transitions. [2023-10-12 17:13:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2023-10-12 17:13:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 3.2586206896551726) internal successors, (189), 57 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 189 transitions. [2023-10-12 17:13:50,448 INFO L241 hiAutomatonCegarLoop]: Abstraction has 58 states and 189 transitions. [2023-10-12 17:13:50,448 INFO L430 stractBuchiCegarLoop]: Abstraction has 58 states and 189 transitions. [2023-10-12 17:13:50,449 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:13:50,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 189 transitions. [2023-10-12 17:13:50,449 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:13:50,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:50,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:50,450 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:13:50,450 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:50,450 INFO L748 eck$LassoCheckResult]: Stem: 913#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 871#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 873#[L95-1, L41]don't care [123] L95-1-->L58: 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] 851#[L96, L41, L58]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 853#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 843#[L96, L41, L58]don't care [2023-10-12 17:13:50,450 INFO L750 eck$LassoCheckResult]: Loop: 843#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 843#[L96, L41, L58]don't care [2023-10-12 17:13:50,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 120984527, now seen corresponding path program 2 times [2023-10-12 17:13:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512779549] [2023-10-12 17:13:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 4 times [2023-10-12 17:13:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99800272] [2023-10-12 17:13:50,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,476 INFO L85 PathProgramCache]: Analyzing trace with hash -544446814, now seen corresponding path program 3 times [2023-10-12 17:13:50,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197976190] [2023-10-12 17:13:50,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:50,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:50,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197976190] [2023-10-12 17:13:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197976190] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:50,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:50,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:13:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494635646] [2023-10-12 17:13:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:13:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:13:50,653 INFO L87 Difference]: Start difference. First operand 58 states and 189 transitions. cyclomatic complexity: 159 Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:50,707 INFO L93 Difference]: Finished difference Result 149 states and 433 transitions. [2023-10-12 17:13:50,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 433 transitions. [2023-10-12 17:13:50,709 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 31 [2023-10-12 17:13:50,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 140 states and 411 transitions. [2023-10-12 17:13:50,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2023-10-12 17:13:50,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2023-10-12 17:13:50,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 411 transitions. [2023-10-12 17:13:50,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:50,712 INFO L219 hiAutomatonCegarLoop]: Abstraction has 140 states and 411 transitions. [2023-10-12 17:13:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 411 transitions. [2023-10-12 17:13:50,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 84. [2023-10-12 17:13:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 3.3333333333333335) internal successors, (280), 83 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 280 transitions. [2023-10-12 17:13:50,725 INFO L241 hiAutomatonCegarLoop]: Abstraction has 84 states and 280 transitions. [2023-10-12 17:13:50,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:13:50,729 INFO L430 stractBuchiCegarLoop]: Abstraction has 84 states and 280 transitions. [2023-10-12 17:13:50,729 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:13:50,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 280 transitions. [2023-10-12 17:13:50,730 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 17 [2023-10-12 17:13:50,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:50,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:50,730 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:13:50,731 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:50,731 INFO L748 eck$LassoCheckResult]: Stem: 1188#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1146#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1148#[L95-1, L41]don't care [123] L95-1-->L58: 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] 1118#[L96, L41, L58]don't care [126] L96-->L76: 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] 1122#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 1240#[L58, L97, L76, L41]don't care [2023-10-12 17:13:50,731 INFO L750 eck$LassoCheckResult]: Loop: 1240#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 1240#[L58, L97, L76, L41]don't care [2023-10-12 17:13:50,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash 120984340, now seen corresponding path program 1 times [2023-10-12 17:13:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677062885] [2023-10-12 17:13:50,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:50,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677062885] [2023-10-12 17:13:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677062885] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:50,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:50,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:50,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717903004] [2023-10-12 17:13:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:50,748 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:13:50,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2023-10-12 17:13:50,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805817175] [2023-10-12 17:13:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:50,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:50,813 INFO L87 Difference]: Start difference. First operand 84 states and 280 transitions. cyclomatic complexity: 232 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:50,835 INFO L93 Difference]: Finished difference Result 127 states and 398 transitions. [2023-10-12 17:13:50,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 398 transitions. [2023-10-12 17:13:50,837 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 17 [2023-10-12 17:13:50,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 114 states and 346 transitions. [2023-10-12 17:13:50,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2023-10-12 17:13:50,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2023-10-12 17:13:50,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 346 transitions. [2023-10-12 17:13:50,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:50,839 INFO L219 hiAutomatonCegarLoop]: Abstraction has 114 states and 346 transitions. [2023-10-12 17:13:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 346 transitions. [2023-10-12 17:13:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2023-10-12 17:13:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 3.1634615384615383) internal successors, (329), 103 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 329 transitions. [2023-10-12 17:13:50,844 INFO L241 hiAutomatonCegarLoop]: Abstraction has 104 states and 329 transitions. [2023-10-12 17:13:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:50,845 INFO L430 stractBuchiCegarLoop]: Abstraction has 104 states and 329 transitions. [2023-10-12 17:13:50,845 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:13:50,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 329 transitions. [2023-10-12 17:13:50,846 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 17 [2023-10-12 17:13:50,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:50,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:50,847 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2023-10-12 17:13:50,847 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:50,847 INFO L748 eck$LassoCheckResult]: Stem: 1493#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1443#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1445#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 1483#[L95-1, L41]don't care [123] L95-1-->L58: 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] 1581#[L96, L41, L58]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 1549#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1541#[L96, L41, L58]don't care [2023-10-12 17:13:50,847 INFO L750 eck$LassoCheckResult]: Loop: 1541#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1541#[L96, L41, L58]don't care [2023-10-12 17:13:50,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash -544187747, now seen corresponding path program 4 times [2023-10-12 17:13:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699238639] [2023-10-12 17:13:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 5 times [2023-10-12 17:13:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652843575] [2023-10-12 17:13:50,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash 310049172, now seen corresponding path program 5 times [2023-10-12 17:13:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176899253] [2023-10-12 17:13:50,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-10-12 17:13:51,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:51,324 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:51,324 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:51,324 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:51,324 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:51,324 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:51,324 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,324 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:51,324 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:51,324 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:13:51,324 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:51,324 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:51,329 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,332 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,335 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,337 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,339 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,448 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,451 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,455 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,457 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,459 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,461 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:51,709 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:51,709 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:51,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,713 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:51,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:13:51,717 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 [2023-10-12 17:13:51,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:51,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,758 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:51,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:13:51,761 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 [2023-10-12 17:13:51,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:51,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:51,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,781 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:51,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:13:51,785 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 [2023-10-12 17:13:51,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:51,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:13:51,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,799 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:51,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:13:51,802 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 [2023-10-12 17:13:51,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,814 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,814 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:51,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:51,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,834 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:51,841 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 [2023-10-12 17:13:51,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,849 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:51,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:13:51,869 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:51,869 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:51,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:51,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:13:51,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,898 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:51,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:13:51,901 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 [2023-10-12 17:13:51,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,914 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:51,918 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:13:51,919 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:13:51,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,920 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:51,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:13:51,923 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:51,940 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:51,940 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:51,940 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:13:51,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:51,946 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:13:51,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:51,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:51,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:51,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:51,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:51,985 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 [2023-10-12 17:13:51,985 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 104 states and 329 transitions. cyclomatic complexity: 262 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:52,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 104 states and 329 transitions. cyclomatic complexity: 262. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 224 states and 666 transitions. Complement of second has 5 states. [2023-10-12 17:13:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:13:52,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:13:52,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:52,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:13:52,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:52,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:52,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:52,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 666 transitions. [2023-10-12 17:13:52,022 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 25 [2023-10-12 17:13:52,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 178 states and 540 transitions. [2023-10-12 17:13:52,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2023-10-12 17:13:52,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-10-12 17:13:52,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 540 transitions. [2023-10-12 17:13:52,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:52,025 INFO L219 hiAutomatonCegarLoop]: Abstraction has 178 states and 540 transitions. [2023-10-12 17:13:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 540 transitions. [2023-10-12 17:13:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2023-10-12 17:13:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 3.2100840336134455) internal successors, (382), 118 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 382 transitions. [2023-10-12 17:13:52,031 INFO L241 hiAutomatonCegarLoop]: Abstraction has 119 states and 382 transitions. [2023-10-12 17:13:52,031 INFO L430 stractBuchiCegarLoop]: Abstraction has 119 states and 382 transitions. [2023-10-12 17:13:52,031 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:13:52,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 119 states and 382 transitions. [2023-10-12 17:13:52,032 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 17 [2023-10-12 17:13:52,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:52,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:52,032 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:52,032 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:52,033 INFO L748 eck$LassoCheckResult]: Stem: 1969#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1921#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1923#[L95-1, L41]don't care [123] L95-1-->L58: 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] 1881#[L96, L41, L58]don't care [126] L96-->L76: 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] 1883#[L58, L97, L76, L41]don't care [142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 1925#[thread1EXIT, L58, L97, L76]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1927#[thread1EXIT, L58, L97, L76]don't care [2023-10-12 17:13:52,033 INFO L750 eck$LassoCheckResult]: Loop: 1927#[thread1EXIT, L58, L97, L76]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 1927#[thread1EXIT, L58, L97, L76]don't care [2023-10-12 17:13:52,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,033 INFO L85 PathProgramCache]: Analyzing trace with hash -544452673, now seen corresponding path program 1 times [2023-10-12 17:13:52,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023172192] [2023-10-12 17:13:52,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 2 times [2023-10-12 17:13:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17155322] [2023-10-12 17:13:52,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,050 INFO L85 PathProgramCache]: Analyzing trace with hash 301836465, now seen corresponding path program 1 times [2023-10-12 17:13:52,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389118387] [2023-10-12 17:13:52,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,375 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:52,375 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:52,375 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:52,375 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:52,375 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:52,375 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,375 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:52,375 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:52,375 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:13:52,375 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:52,375 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:52,377 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,379 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,384 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,390 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,393 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,397 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,400 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,504 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,506 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,508 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:52,783 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:52,783 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:52,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,785 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:13:52,788 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 [2023-10-12 17:13:52,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,802 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:13:52,809 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 [2023-10-12 17:13:52,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,825 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:13:52,828 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 [2023-10-12 17:13:52,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,835 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,835 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,841 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:13:52,848 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 [2023-10-12 17:13:52,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-10-12 17:13:52,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,860 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:13:52,863 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 [2023-10-12 17:13:52,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2023-10-12 17:13:52,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,897 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:13:52,901 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 [2023-10-12 17:13:52,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,929 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:13:52,932 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 [2023-10-12 17:13:52,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,945 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:52,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:13:52,949 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 [2023-10-12 17:13:52,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,955 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:52,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,972 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:52,972 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:53,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:53,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-10-12 17:13:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,006 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:53,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:13:53,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 [2023-10-12 17:13:53,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:53,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:53,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:53,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:53,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:53,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2023-10-12 17:13:53,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,044 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:53,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:13:53,047 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 [2023-10-12 17:13:53,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:53,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:53,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:53,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:53,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-10-12 17:13:53,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,062 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:53,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:13:53,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 [2023-10-12 17:13:53,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:53,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:53,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:53,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,074 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,079 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:53,084 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:13:53,084 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:13:53,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,085 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:53,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:13:53,089 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:53,095 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:53,096 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:53,096 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:13:53,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-10-12 17:13:53,102 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:13:53,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:53,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:53,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:53,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:53,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:53,150 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 [2023-10-12 17:13:53,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 119 states and 382 transitions. cyclomatic complexity: 304 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:53,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 119 states and 382 transitions. cyclomatic complexity: 304. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 304 states and 987 transitions. Complement of second has 5 states. [2023-10-12 17:13:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:53,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2023-10-12 17:13:53,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:13:53,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:13:53,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:53,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 987 transitions. [2023-10-12 17:13:53,201 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 21 [2023-10-12 17:13:53,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 243 states and 767 transitions. [2023-10-12 17:13:53,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2023-10-12 17:13:53,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2023-10-12 17:13:53,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 767 transitions. [2023-10-12 17:13:53,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:53,206 INFO L219 hiAutomatonCegarLoop]: Abstraction has 243 states and 767 transitions. [2023-10-12 17:13:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 767 transitions. [2023-10-12 17:13:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 187. [2023-10-12 17:13:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 187 states have (on average 3.3636363636363638) internal successors, (629), 186 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 629 transitions. [2023-10-12 17:13:53,221 INFO L241 hiAutomatonCegarLoop]: Abstraction has 187 states and 629 transitions. [2023-10-12 17:13:53,221 INFO L430 stractBuchiCegarLoop]: Abstraction has 187 states and 629 transitions. [2023-10-12 17:13:53,221 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:13:53,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 629 transitions. [2023-10-12 17:13:53,223 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 19 [2023-10-12 17:13:53,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:53,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:53,223 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2023-10-12 17:13:53,223 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:53,224 INFO L748 eck$LassoCheckResult]: Stem: 2559#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2509#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2511#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 2551#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 2553#[L95-1, L41]don't care [123] L95-1-->L58: 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] 2701#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2663#[L96, L41, L58]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 2631#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2613#[L96, L41, L58]don't care [2023-10-12 17:13:53,224 INFO L750 eck$LassoCheckResult]: Loop: 2613#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2613#[L96, L41, L58]don't care [2023-10-12 17:13:53,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1029633052, now seen corresponding path program 6 times [2023-10-12 17:13:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478333185] [2023-10-12 17:13:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:53,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 176, now seen corresponding path program 6 times [2023-10-12 17:13:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059773233] [2023-10-12 17:13:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:53,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1853853685, now seen corresponding path program 7 times [2023-10-12 17:13:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836264472] [2023-10-12 17:13:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:53,774 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:53,774 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:53,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:53,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:53,774 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:53,775 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,775 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:53,775 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:53,775 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:13:53,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:53,775 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:53,776 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,779 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,938 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,942 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,945 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,947 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,949 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,951 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,952 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,954 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:53,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:54,278 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:54,278 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:54,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,279 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:54,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:13:54,282 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 [2023-10-12 17:13:54,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:54,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:54,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:54,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:54,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:54,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:54,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:54,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:54,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,295 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:54,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:13:54,298 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 [2023-10-12 17:13:54,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:54,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:54,305 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:54,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:54,327 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:54,327 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:54,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:54,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:54,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,371 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:54,385 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 [2023-10-12 17:13:54,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:54,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:54,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:54,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:54,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-10-12 17:13:54,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:54,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:54,413 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:54,429 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:13:54,429 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:13:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,430 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:54,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-10-12 17:13:54,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:54,447 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:54,448 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:54,448 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:13:54,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:54,456 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:13:54,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:54,501 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 [2023-10-12 17:13:54,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 629 transitions. cyclomatic complexity: 498 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:54,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:54,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:54,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 629 transitions. cyclomatic complexity: 498. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 318 states and 954 transitions. Complement of second has 5 states. [2023-10-12 17:13:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:13:54,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:13:54,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,554 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:54,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:54,604 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:54,604 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 629 transitions. cyclomatic complexity: 498 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:54,639 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 629 transitions. cyclomatic complexity: 498. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 318 states and 954 transitions. Complement of second has 5 states. [2023-10-12 17:13:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:13:54,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:13:54,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,641 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:54,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:54,679 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:54,679 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 629 transitions. cyclomatic complexity: 498 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:54,708 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 629 transitions. cyclomatic complexity: 498. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 360 states and 1121 transitions. Complement of second has 4 states. [2023-10-12 17:13:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-10-12 17:13:54,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:13:54,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:13:54,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:54,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 360 states and 1121 transitions. [2023-10-12 17:13:54,715 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 34 [2023-10-12 17:13:54,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 360 states to 262 states and 836 transitions. [2023-10-12 17:13:54,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2023-10-12 17:13:54,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2023-10-12 17:13:54,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 262 states and 836 transitions. [2023-10-12 17:13:54,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:54,719 INFO L219 hiAutomatonCegarLoop]: Abstraction has 262 states and 836 transitions. [2023-10-12 17:13:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states and 836 transitions. [2023-10-12 17:13:54,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 179. [2023-10-12 17:13:54,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 179 states have (on average 3.3798882681564244) internal successors, (605), 178 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 605 transitions. [2023-10-12 17:13:54,725 INFO L241 hiAutomatonCegarLoop]: Abstraction has 179 states and 605 transitions. [2023-10-12 17:13:54,725 INFO L430 stractBuchiCegarLoop]: Abstraction has 179 states and 605 transitions. [2023-10-12 17:13:54,725 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:13:54,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 605 transitions. [2023-10-12 17:13:54,727 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 22 [2023-10-12 17:13:54,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:54,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:54,728 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:54,728 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:54,728 INFO L748 eck$LassoCheckResult]: Stem: 4044#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 3992#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3994#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 4034#[L95-1, L41]don't care [123] L95-1-->L58: 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] 4040#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4176#[L96, L41, L58]don't care [126] L96-->L76: 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] 4272#[L58, L97, L76, L41]don't care [142] L41-->thread1EXIT: Formula: (and (= (+ 1 v_q1_back_38) v_q1_back_37) (= (select v_q1_20 v_q1_back_38) 0) (<= v_N_10 v_i_22)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_38} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_22, q1_back=v_q1_back_37} AuxVars[] AssignedVars[q1_back] 4122#[thread1EXIT, L58, L97, L76]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 4110#[thread1EXIT, L58, L97, L76]don't care [2023-10-12 17:13:54,728 INFO L750 eck$LassoCheckResult]: Loop: 4110#[thread1EXIT, L58, L97, L76]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 4110#[thread1EXIT, L58, L97, L76]don't care [2023-10-12 17:13:54,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1021958816, now seen corresponding path program 1 times [2023-10-12 17:13:54,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:54,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092858938] [2023-10-12 17:13:54,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:54,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,737 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:54,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 3 times [2023-10-12 17:13:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:54,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149648932] [2023-10-12 17:13:54,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:54,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1615952368, now seen corresponding path program 1 times [2023-10-12 17:13:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333978958] [2023-10-12 17:13:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:55,255 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:55,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:55,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:55,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:55,255 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:55,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:55,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:55,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:13:55,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:55,255 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:55,257 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,262 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,268 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,424 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,427 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,431 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,433 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,435 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,438 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,442 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,444 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:55,743 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:55,743 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:55,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,744 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-10-12 17:13:55,747 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 [2023-10-12 17:13:55,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,759 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-10-12 17:13:55,763 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 [2023-10-12 17:13:55,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:55,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,802 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-10-12 17:13:55,810 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 [2023-10-12 17:13:55,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:55,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,839 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,845 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 [2023-10-12 17:13:55,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-10-12 17:13:55,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:55,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,873 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,877 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 [2023-10-12 17:13:55,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,886 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,886 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-10-12 17:13:55,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:55,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,904 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,909 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 [2023-10-12 17:13:55,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-10-12 17:13:55,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,917 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:13:55,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,936 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:13:55,936 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:13:55,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:55,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,976 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:55,984 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 [2023-10-12 17:13:55,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-10-12 17:13:56,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:56,023 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:13:56,024 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:13:56,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,025 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:56,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2023-10-12 17:13:56,029 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:56,061 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:56,061 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:56,061 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:13:56,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:56,073 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:13:56,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:56,112 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 [2023-10-12 17:13:56,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 605 transitions. cyclomatic complexity: 471 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,133 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 605 transitions. cyclomatic complexity: 471. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 290 states and 925 transitions. Complement of second has 5 states. [2023-10-12 17:13:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:13:56,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:13:56,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,134 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:56,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:56,169 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:56,169 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 605 transitions. cyclomatic complexity: 471 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 605 transitions. cyclomatic complexity: 471. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 290 states and 925 transitions. Complement of second has 5 states. [2023-10-12 17:13:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:56,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:13:56,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:13:56,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,189 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:56,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:56,224 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:56,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 605 transitions. cyclomatic complexity: 471 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,255 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 605 transitions. cyclomatic complexity: 471. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 407 states and 1454 transitions. Complement of second has 5 states. [2023-10-12 17:13:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2023-10-12 17:13:56,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:13:56,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:13:56,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:56,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 1454 transitions. [2023-10-12 17:13:56,263 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 35 [2023-10-12 17:13:56,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 193 states and 628 transitions. [2023-10-12 17:13:56,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-10-12 17:13:56,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2023-10-12 17:13:56,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 193 states and 628 transitions. [2023-10-12 17:13:56,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:56,266 INFO L219 hiAutomatonCegarLoop]: Abstraction has 193 states and 628 transitions. [2023-10-12 17:13:56,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states and 628 transitions. [2023-10-12 17:13:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 84. [2023-10-12 17:13:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 3.1904761904761907) internal successors, (268), 83 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 268 transitions. [2023-10-12 17:13:56,268 INFO L241 hiAutomatonCegarLoop]: Abstraction has 84 states and 268 transitions. [2023-10-12 17:13:56,269 INFO L430 stractBuchiCegarLoop]: Abstraction has 84 states and 268 transitions. [2023-10-12 17:13:56,269 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:13:56,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 268 transitions. [2023-10-12 17:13:56,269 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 23 [2023-10-12 17:13:56,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:56,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:56,270 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:56,270 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2023-10-12 17:13:56,271 INFO L748 eck$LassoCheckResult]: Stem: 5481#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 5479#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 5471#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 5473#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 5475#[L95-1, L41]don't care [123] L95-1-->L58: 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] 5429#[L96, L41, L58]don't care [126] L96-->L76: 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] 5433#[L58, L97, L76, L41]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5447#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 5505#[L58, L97, L76, L41]don't care [2023-10-12 17:13:56,272 INFO L750 eck$LassoCheckResult]: Loop: 5505#[L58, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 5499#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 5591#[L58, L97, L76, L41]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5493#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 5505#[L58, L97, L76, L41]don't care [2023-10-12 17:13:56,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1029615195, now seen corresponding path program 1 times [2023-10-12 17:13:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939955459] [2023-10-12 17:13:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 4998956, now seen corresponding path program 1 times [2023-10-12 17:13:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348600781] [2023-10-12 17:13:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -141019002, now seen corresponding path program 2 times [2023-10-12 17:13:56,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961135462] [2023-10-12 17:13:56,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:56,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:56,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:13:56,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961135462] [2023-10-12 17:13:56,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961135462] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:13:56,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202525823] [2023-10-12 17:13:56,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:13:56,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:13:56,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,437 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:13:56,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-10-12 17:13:56,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:13:56,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:13:56,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:56,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-10-12 17:13:56,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:13:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202525823] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:13:56,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2023-10-12 17:13:56,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683221223] [2023-10-12 17:13:56,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:56,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:13:56,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:13:56,990 INFO L87 Difference]: Start difference. First operand 84 states and 268 transitions. cyclomatic complexity: 202 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:57,032 INFO L93 Difference]: Finished difference Result 182 states and 559 transitions. [2023-10-12 17:13:57,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 559 transitions. [2023-10-12 17:13:57,034 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 47 [2023-10-12 17:13:57,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 179 states and 536 transitions. [2023-10-12 17:13:57,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2023-10-12 17:13:57,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2023-10-12 17:13:57,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 179 states and 536 transitions. [2023-10-12 17:13:57,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:57,036 INFO L219 hiAutomatonCegarLoop]: Abstraction has 179 states and 536 transitions. [2023-10-12 17:13:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states and 536 transitions. [2023-10-12 17:13:57,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2023-10-12 17:13:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 139 states have (on average 3.20863309352518) internal successors, (446), 138 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 446 transitions. [2023-10-12 17:13:57,040 INFO L241 hiAutomatonCegarLoop]: Abstraction has 139 states and 446 transitions. [2023-10-12 17:13:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:13:57,041 INFO L430 stractBuchiCegarLoop]: Abstraction has 139 states and 446 transitions. [2023-10-12 17:13:57,041 INFO L337 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-10-12 17:13:57,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 446 transitions. [2023-10-12 17:13:57,042 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 38 [2023-10-12 17:13:57,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:57,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:57,042 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:57,042 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-10-12 17:13:57,043 INFO L748 eck$LassoCheckResult]: Stem: 5882#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 5880#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 5860#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 5862#[L95-1, L41]don't care [123] L95-1-->L58: 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] 5892#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5890#[L96, L41, L58]don't care [126] L96-->L76: 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] 5842#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 6014#[L58, L97, L76, L41]don't care [2023-10-12 17:13:57,043 INFO L750 eck$LassoCheckResult]: Loop: 6014#[L58, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 6034#[L58, L97, L76, L41]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 6036#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 6014#[L58, L97, L76, L41]don't care [2023-10-12 17:13:57,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash 310061075, now seen corresponding path program 3 times [2023-10-12 17:13:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:57,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843154012] [2023-10-12 17:13:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:57,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash 161282, now seen corresponding path program 2 times [2023-10-12 17:13:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899160071] [2023-10-12 17:13:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:57,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1445036880, now seen corresponding path program 4 times [2023-10-12 17:13:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289751028] [2023-10-12 17:13:57,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:57,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:57,761 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:57,761 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:57,761 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:57,761 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:57,761 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:57,762 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:57,762 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:57,762 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:57,762 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration12_Lasso [2023-10-12 17:13:57,762 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:57,762 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:57,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:57,771 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:57,773 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:58,203 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:58,205 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:58,207 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:58,209 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:58,585 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:58,585 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:58,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,587 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2023-10-12 17:13:58,590 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 [2023-10-12 17:13:58,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2023-10-12 17:13:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,603 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2023-10-12 17:13:58,608 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 [2023-10-12 17:13:58,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2023-10-12 17:13:58,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,623 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-10-12 17:13:58,627 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 [2023-10-12 17:13:58,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,640 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2023-10-12 17:13:58,644 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 [2023-10-12 17:13:58,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2023-10-12 17:13:58,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,658 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2023-10-12 17:13:58,661 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 [2023-10-12 17:13:58,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,673 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,677 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2023-10-12 17:13:58,680 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 [2023-10-12 17:13:58,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,693 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,697 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 [2023-10-12 17:13:58,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2023-10-12 17:13:58,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,733 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,737 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 [2023-10-12 17:13:58,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2023-10-12 17:13:58,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,765 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,769 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:58,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2023-10-12 17:13:58,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,795 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,801 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 [2023-10-12 17:13:58,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2023-10-12 17:13:58,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:58,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,841 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2023-10-12 17:13:58,844 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 [2023-10-12 17:13:58,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:58,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:58,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:58,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:58,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:58,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:58,868 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:58,878 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:13:58,878 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:13:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,881 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,893 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:58,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2023-10-12 17:13:58,912 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:58,912 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:58,912 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:13:58,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:58,921 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:13:58,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:58,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:13:58,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:59,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-10-12 17:13:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:59,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:13:59,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:59,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2023-10-12 17:13:59,065 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2023-10-12 17:13:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:59,147 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2023-10-12 17:13:59,147 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 446 transitions. cyclomatic complexity: 333 Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:59,250 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 446 transitions. cyclomatic complexity: 333. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 276 states and 896 transitions. Complement of second has 11 states. [2023-10-12 17:13:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2023-10-12 17:13:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2023-10-12 17:13:59,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 7 letters. Loop has 3 letters. [2023-10-12 17:13:59,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:59,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 10 letters. Loop has 3 letters. [2023-10-12 17:13:59,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:59,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 7 letters. Loop has 6 letters. [2023-10-12 17:13:59,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:59,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 276 states and 896 transitions. [2023-10-12 17:13:59,254 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 38 [2023-10-12 17:13:59,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 276 states to 256 states and 819 transitions. [2023-10-12 17:13:59,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2023-10-12 17:13:59,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2023-10-12 17:13:59,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 819 transitions. [2023-10-12 17:13:59,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:59,257 INFO L219 hiAutomatonCegarLoop]: Abstraction has 256 states and 819 transitions. [2023-10-12 17:13:59,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 819 transitions. [2023-10-12 17:13:59,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 166. [2023-10-12 17:13:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 166 states have (on average 3.2710843373493974) internal successors, (543), 165 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 543 transitions. [2023-10-12 17:13:59,262 INFO L241 hiAutomatonCegarLoop]: Abstraction has 166 states and 543 transitions. [2023-10-12 17:13:59,262 INFO L430 stractBuchiCegarLoop]: Abstraction has 166 states and 543 transitions. [2023-10-12 17:13:59,262 INFO L337 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-10-12 17:13:59,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 543 transitions. [2023-10-12 17:13:59,263 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 38 [2023-10-12 17:13:59,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:59,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:59,264 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:59,264 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-10-12 17:13:59,264 INFO L748 eck$LassoCheckResult]: Stem: 6514#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 6512#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 6502#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 6504#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 6508#[L95-1, L41]don't care [123] L95-1-->L58: 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] 6468#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 6470#[L96, L41, L58]don't care [126] L96-->L76: 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] 6456#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 6458#[L58, L97, L76, L41]don't care [2023-10-12 17:13:59,264 INFO L750 eck$LassoCheckResult]: Loop: 6458#[L58, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 6656#[L58, L97, L76, L41]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 6658#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 6458#[L58, L97, L76, L41]don't care [2023-10-12 17:13:59,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1029632865, now seen corresponding path program 5 times [2023-10-12 17:13:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749297734] [2023-10-12 17:13:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash 161282, now seen corresponding path program 3 times [2023-10-12 17:13:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626932195] [2023-10-12 17:13:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,288 INFO L85 PathProgramCache]: Analyzing trace with hash -863615326, now seen corresponding path program 6 times [2023-10-12 17:13:59,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48105472] [2023-10-12 17:13:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,303 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:00,145 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:00,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:00,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:00,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:00,146 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:00,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:00,146 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:00,146 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration13_Lasso [2023-10-12 17:14:00,146 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:00,146 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:00,150 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,155 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,157 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,159 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,622 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,626 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,959 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2023-10-12 17:14:03,890 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:03,891 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:03,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:03,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:03,892 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:03,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2023-10-12 17:14:03,910 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 [2023-10-12 17:14:03,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:03,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:03,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:03,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:03,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:03,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:03,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:03,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2023-10-12 17:14:03,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:03,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:03,922 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:03,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2023-10-12 17:14:03,926 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 [2023-10-12 17:14:03,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:03,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:03,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:03,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:03,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:03,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:03,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:03,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:03,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:03,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:03,938 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:03,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2023-10-12 17:14:03,941 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 [2023-10-12 17:14:03,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:03,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:03,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:03,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:03,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:03,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:03,950 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:03,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2023-10-12 17:14:03,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:03,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:03,953 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:03,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2023-10-12 17:14:03,956 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 [2023-10-12 17:14:03,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:03,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:03,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:03,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:03,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:03,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:03,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:03,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2023-10-12 17:14:03,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:03,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:03,968 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:03,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2023-10-12 17:14:03,971 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 [2023-10-12 17:14:03,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:03,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:03,978 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2023-10-12 17:14:03,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:04,280 INFO L401 nArgumentSynthesizer]: We have 96 Motzkin's Theorem applications. [2023-10-12 17:14:04,280 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2023-10-12 17:14:07,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:08,554 INFO L443 ModelExtractionUtils]: Simplification made 30 calls to the SMT solver. [2023-10-12 17:14:08,555 INFO L444 ModelExtractionUtils]: 226 out of 287 variables were initially zero. Simplification set additionally 56 variables to zero. [2023-10-12 17:14:08,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:08,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:08,595 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:08,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2023-10-12 17:14:08,598 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:08,611 INFO L438 nArgumentSynthesizer]: Removed 12 redundant supporting invariants from a total of 12. [2023-10-12 17:14:08,612 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:08,612 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i, q1_front, q1_back) = 1*N - 1*i - 1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:14:08,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2023-10-12 17:14:08,640 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:14:08,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:08,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:08,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:08,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:14:08,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:08,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2023-10-12 17:14:08,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2023-10-12 17:14:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:08,755 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-10-12 17:14:08,755 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 543 transitions. cyclomatic complexity: 409 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:08,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:08,817 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 543 transitions. cyclomatic complexity: 409. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 362 states and 1416 transitions. Complement of second has 6 states. [2023-10-12 17:14:08,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2023-10-12 17:14:08,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 3 letters. [2023-10-12 17:14:08,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:08,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 3 letters. [2023-10-12 17:14:08,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:08,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 8 letters. Loop has 6 letters. [2023-10-12 17:14:08,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:08,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 1416 transitions. [2023-10-12 17:14:08,822 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:14:08,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 319 states and 1169 transitions. [2023-10-12 17:14:08,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-10-12 17:14:08,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2023-10-12 17:14:08,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 319 states and 1169 transitions. [2023-10-12 17:14:08,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:08,826 INFO L219 hiAutomatonCegarLoop]: Abstraction has 319 states and 1169 transitions. [2023-10-12 17:14:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states and 1169 transitions. [2023-10-12 17:14:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 219. [2023-10-12 17:14:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 219 states have (on average 3.675799086757991) internal successors, (805), 218 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:08,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 805 transitions. [2023-10-12 17:14:08,832 INFO L241 hiAutomatonCegarLoop]: Abstraction has 219 states and 805 transitions. [2023-10-12 17:14:08,832 INFO L430 stractBuchiCegarLoop]: Abstraction has 219 states and 805 transitions. [2023-10-12 17:14:08,833 INFO L337 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-10-12 17:14:08,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219 states and 805 transitions. [2023-10-12 17:14:08,834 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:08,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:08,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:08,834 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:08,835 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:08,835 INFO L748 eck$LassoCheckResult]: Stem: 7276#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 7274#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 7262#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 7264#[L95-1, L41]don't care [123] L95-1-->L58: 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] 7306#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 7280#[L96, L41, L58]don't care [135] L58-->thread2EXIT: Formula: (not v_f_5) InVars {f=v_f_5} OutVars{f=v_f_5} AuxVars[] AssignedVars[] 7282#[thread2EXIT, L41, L96]don't care [126] L96-->L76: 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] 7244#[thread2EXIT, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 7246#[thread2EXIT, L97, L76, L41]don't care [2023-10-12 17:14:08,835 INFO L750 eck$LassoCheckResult]: Loop: 7246#[thread2EXIT, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 7246#[thread2EXIT, L97, L76, L41]don't care [2023-10-12 17:14:08,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:08,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1021966968, now seen corresponding path program 1 times [2023-10-12 17:14:08,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:08,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339592949] [2023-10-12 17:14:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:08,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:08,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339592949] [2023-10-12 17:14:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339592949] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:14:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516070391] [2023-10-12 17:14:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:08,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:14:08,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:08,885 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:14:08,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2023-10-12 17:14:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:08,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:14:08,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:08,953 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:14:08,985 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-10-12 17:14:08,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2023-10-12 17:14:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516070391] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:14:08,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:14:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-10-12 17:14:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430685467] [2023-10-12 17:14:09,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:14:09,000 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:14:09,000 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash 163, now seen corresponding path program 2 times [2023-10-12 17:14:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367039883] [2023-10-12 17:14:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:09,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:09,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:14:09,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:14:09,082 INFO L87 Difference]: Start difference. First operand 219 states and 805 transitions. cyclomatic complexity: 637 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:09,127 INFO L93 Difference]: Finished difference Result 243 states and 823 transitions. [2023-10-12 17:14:09,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 243 states and 823 transitions. [2023-10-12 17:14:09,129 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2023-10-12 17:14:09,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 243 states to 243 states and 823 transitions. [2023-10-12 17:14:09,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2023-10-12 17:14:09,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2023-10-12 17:14:09,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 243 states and 823 transitions. [2023-10-12 17:14:09,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:09,132 INFO L219 hiAutomatonCegarLoop]: Abstraction has 243 states and 823 transitions. [2023-10-12 17:14:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states and 823 transitions. [2023-10-12 17:14:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 218. [2023-10-12 17:14:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 218 states have (on average 3.5596330275229358) internal successors, (776), 217 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 776 transitions. [2023-10-12 17:14:09,137 INFO L241 hiAutomatonCegarLoop]: Abstraction has 218 states and 776 transitions. [2023-10-12 17:14:09,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:14:09,138 INFO L430 stractBuchiCegarLoop]: Abstraction has 218 states and 776 transitions. [2023-10-12 17:14:09,138 INFO L337 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2023-10-12 17:14:09,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 776 transitions. [2023-10-12 17:14:09,139 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2023-10-12 17:14:09,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:09,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:09,140 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:09,140 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:09,140 INFO L748 eck$LassoCheckResult]: Stem: 8011#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 7999#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 8001#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 8003#[L95-1, L41]don't care [123] L95-1-->L58: 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] 8007#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 7967#[L96, L41, L58]don't care [126] L96-->L76: 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] 7969#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 8301#[L58, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 8077#[L58, L97, L76, L41]don't care [2023-10-12 17:14:09,141 INFO L750 eck$LassoCheckResult]: Loop: 8077#[L58, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 8077#[L58, L97, L76, L41]don't care [2023-10-12 17:14:09,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1021958865, now seen corresponding path program 7 times [2023-10-12 17:14:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000595795] [2023-10-12 17:14:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:09,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash 163, now seen corresponding path program 3 times [2023-10-12 17:14:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:09,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207654712] [2023-10-12 17:14:09,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:09,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1615953875, now seen corresponding path program 8 times [2023-10-12 17:14:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:09,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037721798] [2023-10-12 17:14:09,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:09,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:09,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:09,809 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:09,809 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:09,810 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:09,810 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:09,810 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:09,810 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:09,810 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:09,810 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:09,810 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration15_Lasso [2023-10-12 17:14:09,810 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:09,810 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:09,813 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:09,816 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,218 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,224 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,226 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,230 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:10,545 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:14:10,546 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2023-10-12 17:14:11,490 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:11,491 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:11,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:11,492 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:11,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2023-10-12 17:14:11,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:11,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:11,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:11,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:11,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:11,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:11,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:11,506 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:11,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:11,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:11,509 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:11,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2023-10-12 17:14:11,513 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 [2023-10-12 17:14:11,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:11,520 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2023-10-12 17:14:11,520 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:11,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:11,556 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2023-10-12 17:14:11,556 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:11,622 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:11,665 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:14:11,665 INFO L444 ModelExtractionUtils]: 87 out of 101 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:11,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:11,667 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:11,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2023-10-12 17:14:11,669 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:11,699 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-10-12 17:14:11,699 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:11,699 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q3_back, N, i, q3_front) = 1*q3_back + 1*N - 1*i - 1*q3_front Supporting invariants [1*q3_back - 1*q3_front >= 0] [2023-10-12 17:14:11,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:11,713 INFO L156 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:14:11,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:11,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:14:11,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:11,835 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:11,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:11,835 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2023-10-12 17:14:11,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 776 transitions. cyclomatic complexity: 610 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:11,872 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 776 transitions. cyclomatic complexity: 610. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 286 states and 908 transitions. Complement of second has 6 states. [2023-10-12 17:14:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:11,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2023-10-12 17:14:11,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:11,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:11,873 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:11,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:11,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:14:11,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:11,971 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:11,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:11,971 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 1 loop predicates [2023-10-12 17:14:11,972 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 776 transitions. cyclomatic complexity: 610 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 776 transitions. cyclomatic complexity: 610. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 286 states and 908 transitions. Complement of second has 6 states. [2023-10-12 17:14:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2023-10-12 17:14:12,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:12,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,008 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:12,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:14:12,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,117 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:12,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:12,119 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2023-10-12 17:14:12,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 218 states and 776 transitions. cyclomatic complexity: 610 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,206 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 218 states and 776 transitions. cyclomatic complexity: 610. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 540 states and 1696 transitions. Complement of second has 12 states. [2023-10-12 17:14:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:14:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2023-10-12 17:14:12,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:12,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:12,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:12,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 540 states and 1696 transitions. [2023-10-12 17:14:12,217 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-10-12 17:14:12,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 540 states to 362 states and 1117 transitions. [2023-10-12 17:14:12,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2023-10-12 17:14:12,220 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2023-10-12 17:14:12,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 1117 transitions. [2023-10-12 17:14:12,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:12,221 INFO L219 hiAutomatonCegarLoop]: Abstraction has 362 states and 1117 transitions. [2023-10-12 17:14:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 1117 transitions. [2023-10-12 17:14:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 268. [2023-10-12 17:14:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 268 states have (on average 3.2723880597014925) internal successors, (877), 267 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 877 transitions. [2023-10-12 17:14:12,229 INFO L241 hiAutomatonCegarLoop]: Abstraction has 268 states and 877 transitions. [2023-10-12 17:14:12,229 INFO L430 stractBuchiCegarLoop]: Abstraction has 268 states and 877 transitions. [2023-10-12 17:14:12,229 INFO L337 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2023-10-12 17:14:12,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 268 states and 877 transitions. [2023-10-12 17:14:12,231 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:12,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:12,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:12,231 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2023-10-12 17:14:12,231 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:12,232 INFO L748 eck$LassoCheckResult]: Stem: 9712#[$Ultimate##0]don't care [96] $Ultimate##0-->L95: Formula: (and (= v_q3_front_5 v_q3_back_2) (= v_i_5 0) (<= 0 v_N_3) (= v_i_5 v_t_1) (or (and v_f_4 v_g_1) (and (not v_g_1) (not v_f_4))) (= v_q2_front_1 v_q2_back_4) (= v_i_5 v_r_3) v_g_1 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q3_back=v_q3_back_2, t=v_t_1, s=v_s_3, r=v_r_3, q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, i=v_i_5, g=v_g_1, f=v_f_4, q3_front=v_q3_front_5, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 9710#[L95]don't care [120] L95-->L41: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 9698#[L95-1, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 9700#[L95-1, L41]don't care [123] L95-1-->L58: 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] 9706#[L96, L41, L58]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 9670#[L96, L41, L58]don't care [126] L96-->L76: 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] 9672#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 10018#[L58, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 10020#[L58, L97, L76, L41]don't care [145] L58-->L58: Formula: (and v_f_24 (< v_q1_front_47 v_q1_back_65) (= (select v_q1_36 v_q1_front_47) v_j_33) (= (+ v_q2_back_49 1) v_q2_back_48) (= v_s_24 (+ v_j_33 v_s_25)) (= (+ (select v_q2_31 v_q2_back_49) 1) v_j_33) (= v_q1_front_46 (+ v_q1_front_47 1)) (or (and (not v_f_23) (<= v_j_33 0)) (and (< 0 v_j_33) v_f_23))) InVars {q1_front=v_q1_front_47, q1=v_q1_36, q2=v_q2_31, q2_back=v_q2_back_49, f=v_f_24, s=v_s_25, q1_back=v_q1_back_65} OutVars{q1_front=v_q1_front_46, q1=v_q1_36, q2=v_q2_31, j=v_j_33, q2_back=v_q2_back_48, f=v_f_23, s=v_s_24, q1_back=v_q1_back_65} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 10036#[L58, L97, L76, L41]don't care [144] L76-->L76: Formula: (and (= (+ v_q2_front_35 1) v_q2_front_34) v_g_14 (= (+ (select v_q3_21 v_q3_back_31) 1) v_k_23) (= (+ v_k_23 v_t_9) v_t_8) (= v_q3_back_30 (+ v_q3_back_31 1)) (< v_q2_front_35 v_q2_back_34) (= v_k_23 (select v_q2_23 v_q2_front_35)) (or (and (<= v_k_23 0) (not v_g_13)) (and (< 0 v_k_23) v_g_13))) InVars {q2=v_q2_23, q2_back=v_q2_back_34, g=v_g_14, q3_back=v_q3_back_31, t=v_t_9, q3=v_q3_21, q2_front=v_q2_front_35} OutVars{q2=v_q2_23, k=v_k_23, q2_back=v_q2_back_34, g=v_g_13, q3_back=v_q3_back_30, t=v_t_8, q3=v_q3_21, q2_front=v_q2_front_34} AuxVars[] AssignedVars[k, g, q3_back, t, q2_front] 9842#[L58, L97, L76, L41]don't care [2023-10-12 17:14:12,232 INFO L750 eck$LassoCheckResult]: Loop: 9842#[L58, L97, L76, L41]don't care [132] L41-->L41: Formula: (and (< v_i_17 v_N_6) (or (and (= v_q1_back_28 v_q1_back_27) (= (select v_q3_13 v_q3_front_19) v_l_9) (= (+ v_q3_front_19 1) v_q3_front_18) (= v_r_9 (+ v_r_10 v_l_9)) (= v_i_17 v_i_16) (< v_q3_front_19 v_q3_back_18)) (and (= (+ 1 v_q1_back_28) v_q1_back_27) (= 2 (select v_q1_14 v_q1_back_28)) (= v_l_10 v_l_9) (= (+ v_i_17 1) v_i_16) (= v_r_10 v_r_9) (= v_q3_front_19 v_q3_front_18)))) InVars {q1=v_q1_14, N=v_N_6, l=v_l_10, i=v_i_17, q3_front=v_q3_front_19, q3_back=v_q3_back_18, q1_back=v_q1_back_28, q3=v_q3_13, r=v_r_10} OutVars{q1=v_q1_14, N=v_N_6, l=v_l_9, i=v_i_16, q3_front=v_q3_front_18, q3_back=v_q3_back_18, q1_back=v_q1_back_27, q3=v_q3_13, r=v_r_9} AuxVars[] AssignedVars[l, i, q3_front, q1_back, r] 9842#[L58, L97, L76, L41]don't care [2023-10-12 17:14:12,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1445036880, now seen corresponding path program 9 times [2023-10-12 17:14:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422858334] [2023-10-12 17:14:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,246 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash 163, now seen corresponding path program 4 times [2023-10-12 17:14:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435612410] [2023-10-12 17:14:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1846470188, now seen corresponding path program 10 times [2023-10-12 17:14:12,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658527741] [2023-10-12 17:14:12,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:13,070 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:13,071 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:13,071 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:13,071 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:13,071 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:13,071 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,071 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:13,071 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:13,071 INFO L133 ssoRankerPreferences]: Filename of dumped script: ring-nondet.wvr.bpl_BEv2_Iteration16_Lasso [2023-10-12 17:14:13,071 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:13,071 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:13,073 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,500 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,504 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,506 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,508 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,512 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,514 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,515 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:13,794 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2023-10-12 17:14:14,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:14,135 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,137 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:14,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2023-10-12 17:14:14,140 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 [2023-10-12 17:14:14,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,150 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:14,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,183 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:14:14,184 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:14,245 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:14,286 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:14:14,287 INFO L444 ModelExtractionUtils]: 108 out of 121 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:14,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,289 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:14,297 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:14,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2023-10-12 17:14:14,309 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-10-12 17:14:14,309 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:14,309 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q3_back, N, i, q3_front) = 1*q3_back + 1*N - 1*i - 1*q3_front Supporting invariants [-1*q3_front + 1*q3_back >= 0] [2023-10-12 17:14:14,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:14,326 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2023-10-12 17:14:14,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:14,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:14:14,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:14,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:14,459 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-10-12 17:14:14,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 50 [2023-10-12 17:14:14,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-10-12 17:14:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:14,490 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:14,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:14,491 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 1 loop predicates [2023-10-12 17:14:14,491 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 877 transitions. cyclomatic complexity: 682 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:14,557 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 877 transitions. cyclomatic complexity: 682. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 412 states and 1276 transitions. Complement of second has 7 states. [2023-10-12 17:14:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2023-10-12 17:14:14,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:14,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:14,558 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:14,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:14,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2023-10-12 17:14:14,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:14,719 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2023-10-12 17:14:14,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-10-12 17:14:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:14,791 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:14,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:14,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:14,792 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 1 loop predicates [2023-10-12 17:14:14,792 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 877 transitions. cyclomatic complexity: 682 Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:14,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 877 transitions. cyclomatic complexity: 682. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 413 states and 1239 transitions. Complement of second has 9 states. [2023-10-12 17:14:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:14:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2023-10-12 17:14:14,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:14,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:14,895 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:14,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:14,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:14:14,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:15,021 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-10-12 17:14:15,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 50 [2023-10-12 17:14:15,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-10-12 17:14:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:15,046 WARN L260 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:15,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:15,047 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 1 loop predicates [2023-10-12 17:14:15,047 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 268 states and 877 transitions. cyclomatic complexity: 682 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:15,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 268 states and 877 transitions. cyclomatic complexity: 682. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 522 states and 1726 transitions. Complement of second has 11 states. [2023-10-12 17:14:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 5 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2023-10-12 17:14:15,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:15,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:15,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:15,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 522 states and 1726 transitions. [2023-10-12 17:14:15,146 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:15,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 522 states to 0 states and 0 transitions. [2023-10-12 17:14:15,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:15,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:15,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:15,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:15,146 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:15,146 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:15,147 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:15,147 INFO L337 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2023-10-12 17:14:15,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:15,147 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:15,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:15,152 INFO L201 PluginConnector]: Adding new model ring-nondet.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:15 BoogieIcfgContainer [2023-10-12 17:14:15,152 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:15,153 INFO L158 Benchmark]: Toolchain (without parser) took 29814.40ms. Allocated memory was 210.8MB in the beginning and 461.4MB in the end (delta: 250.6MB). Free memory was 162.8MB in the beginning and 297.0MB in the end (delta: -134.2MB). Peak memory consumption was 117.6MB. Max. memory is 8.0GB. [2023-10-12 17:14:15,153 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 210.8MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:15,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.39ms. Allocated memory is still 210.8MB. Free memory was 162.6MB in the beginning and 161.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:15,154 INFO L158 Benchmark]: Boogie Preprocessor took 34.82ms. Allocated memory is still 210.8MB. Free memory was 161.2MB in the beginning and 160.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:15,154 INFO L158 Benchmark]: RCFGBuilder took 296.93ms. Allocated memory is still 210.8MB. Free memory was 160.0MB in the beginning and 146.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-10-12 17:14:15,155 INFO L158 Benchmark]: BuchiAutomizer took 29453.17ms. Allocated memory was 210.8MB in the beginning and 461.4MB in the end (delta: 250.6MB). Free memory was 146.7MB in the beginning and 297.0MB in the end (delta: -150.3MB). Peak memory consumption was 101.8MB. Max. memory is 8.0GB. [2023-10-12 17:14:15,156 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.27ms. Allocated memory is still 210.8MB. Free memory is still 164.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.39ms. Allocated memory is still 210.8MB. Free memory was 162.6MB in the beginning and 161.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.82ms. Allocated memory is still 210.8MB. Free memory was 161.2MB in the beginning and 160.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 296.93ms. Allocated memory is still 210.8MB. Free memory was 160.0MB in the beginning and 146.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 29453.17ms. Allocated memory was 210.8MB in the beginning and 461.4MB in the end (delta: 250.6MB). Free memory was 146.7MB in the beginning and 297.0MB in the end (delta: -150.3MB). Peak memory consumption was 101.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (5 trivial, 7 deterministic, 4 nondeterministic). One deterministic module has affine ranking function q3_back + N + -1 * i + -1 * q3_front and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i and consists of 8 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back + N + -1 * i and consists of 4 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function q3_back + N + -1 * i + -1 * q3_front and consists of 7 locations. One nondeterministic module has affine ranking function q3_back + N + -1 * i + -1 * q3_front and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.3s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 25.2s. Construction of modules took 0.6s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 795 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 366 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 767 IncrementalHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 24 mSDtfsCounter, 767 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU2 SILI0 SILT0 lasso11 LassoPreprocessingBenchmarks: Lassos: inital165 mio100 ax100 hnf100 lsp165 ukn66 mio100 lsp72 div100 bol108 ite100 ukn100 eq193 hnf91 smp100 dnf775 smp51 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 4644ms VariablesStem: 36 VariablesLoop: 33 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 96 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 37 PlacesBefore, 22 PlacesAfterwards, 30 TransitionsBefore, 15 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 281, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 212, independent: 206, independent conditional: 0, independent unconditional: 206, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 212, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 281, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 212, unknown conditional: 0, unknown unconditional: 212] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:14:15,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:15,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2023-10-12 17:14:15,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...