/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/horseshoe.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:20,234 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:20,295 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:14:20,317 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:20,318 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:20,318 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:20,319 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:20,319 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:20,320 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:20,323 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:20,323 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:20,323 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:20,323 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:20,324 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:20,325 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:20,325 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:20,325 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:20,325 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:20,325 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:20,325 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:20,326 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:20,327 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:20,327 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:20,327 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:20,327 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:20,327 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:20,327 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:20,328 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:20,328 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:20,328 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:20,329 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:20,329 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:20,329 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:20,330 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:20,330 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:14:20,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:20,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:20,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:20,551 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:20,551 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:20,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/horseshoe.wvr.bpl [2023-10-12 17:14:20,553 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/horseshoe.wvr.bpl' [2023-10-12 17:14:20,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:20,583 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:20,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:20,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:20,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:20,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,602 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:20,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:20,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:20,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:20,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:20,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:20,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:20,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:20,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:20,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/1) ... [2023-10-12 17:14:20,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:20,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:20,670 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:14:20,676 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:14:20,703 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:20,703 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:20,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:20,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:20,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:20,704 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:20,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:20,704 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:20,705 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:14:20,743 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:20,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:20,896 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:20,918 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:20,918 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:20,926 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:20 BoogieIcfgContainer [2023-10-12 17:14:20,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:20,927 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:20,927 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:20,943 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:20,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:20,944 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:20" (1/2) ... [2023-10-12 17:14:20,945 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@223fed0b and model type horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:20, skipping insertion in model container [2023-10-12 17:14:20,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:20,945 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:20" (2/2) ... [2023-10-12 17:14:20,947 INFO L332 chiAutomizerObserver]: Analyzing ICFG horseshoe.wvr.bpl [2023-10-12 17:14:21,013 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:14:21,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:14:21,057 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:14:21,057 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:21,060 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 55 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:14:21,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 36 transitions, 96 flow [2023-10-12 17:14:21,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2023-10-12 17:14:21,065 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:21,073 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:14:21,077 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 30 transitions, 78 flow [2023-10-12 17:14:21,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 78 flow [2023-10-12 17:14:21,083 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2023-10-12 17:14:21,084 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:21,084 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 55 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:14:21,084 INFO L119 LiptonReduction]: Number of co-enabled transitions 316 [2023-10-12 17:14:21,633 INFO L134 LiptonReduction]: Checked pairs total: 277 [2023-10-12 17:14:21,633 INFO L136 LiptonReduction]: Total number of compositions: 16 [2023-10-12 17:14:21,650 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:21,651 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:21,651 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:21,651 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:21,651 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:21,651 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:21,651 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:21,652 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:21,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:21,686 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:14:21,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:21,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:21,692 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:21,693 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:21,693 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:21,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 24 states, but on-demand construction may add more states [2023-10-12 17:14:21,699 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:14:21,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:21,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:21,700 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:21,700 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:21,704 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 46#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 48#[L28, L77-1]don't care [2023-10-12 17:14:21,705 INFO L750 eck$LassoCheckResult]: Loop: 48#[L28, L77-1]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 48#[L28, L77-1]don't care [2023-10-12 17:14:21,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,710 INFO L85 PathProgramCache]: Analyzing trace with hash 3576, now seen corresponding path program 1 times [2023-10-12 17:14:21,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:21,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19486810] [2023-10-12 17:14:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:21,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,831 INFO L85 PathProgramCache]: Analyzing trace with hash 157, now seen corresponding path program 1 times [2023-10-12 17:14:21,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:21,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895152922] [2023-10-12 17:14:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:21,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:21,856 INFO L85 PathProgramCache]: Analyzing trace with hash 110982, now seen corresponding path program 1 times [2023-10-12 17:14:21,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:21,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750572022] [2023-10-12 17:14:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:21,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:21,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:21,964 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:21,964 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:21,964 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:21,964 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:21,964 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:21,965 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:21,965 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:21,965 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:21,965 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:21,965 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:21,965 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:21,975 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:21,981 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:21,991 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:21,993 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:21,995 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:21,998 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:22,000 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:22,002 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:22,075 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:22,078 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:22,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,082 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:14:22,090 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:22,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,097 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:14:22,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,128 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:14:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,130 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:14:22,132 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:14:22,133 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:22,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,140 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:14:22,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:14:22,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:14:22,156 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:22,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,162 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:14:22,164 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:14:22,165 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:22,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,193 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,202 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:14:22,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,213 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:14:22,219 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:22,219 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:14:22,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,249 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:14:22,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,251 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:14:22,254 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:14:22,255 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:22,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,265 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,265 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,283 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:14:22,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,286 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:14:22,288 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:14:22,290 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:22,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,345 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:14:22,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,347 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:14:22,349 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:14:22,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:14:22,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,384 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:14:22,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,385 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:14:22,397 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:22,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,408 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:14:22,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:22,429 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:14:22,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,430 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:14:22,431 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:14:22,433 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:22,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:22,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:22,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:22,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:22,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:22,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:22,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:22,464 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:22,465 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:22,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:22,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:22,468 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:14:22,469 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:14:22,470 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:22,486 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:22,486 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:22,486 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:22,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:22,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:22,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:22,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:22,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:22,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:22,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:22,554 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:22,574 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:14:22,576 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 24 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) 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:14:22,627 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 24 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) 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 65 states and 193 transitions. Complement of second has 5 states. [2023-10-12 17:14:22,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) 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:14:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2023-10-12 17:14:22,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:14:22,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:22,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:22,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:22,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:14:22,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:22,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 193 transitions. [2023-10-12 17:14:22,641 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:22,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 39 states and 120 transitions. [2023-10-12 17:14:22,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-10-12 17:14:22,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-10-12 17:14:22,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 120 transitions. [2023-10-12 17:14:22,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:22,645 INFO L219 hiAutomatonCegarLoop]: Abstraction has 39 states and 120 transitions. [2023-10-12 17:14:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 120 transitions. [2023-10-12 17:14:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2023-10-12 17:14:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 28 states have internal predecessors, (92), 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:22,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2023-10-12 17:14:22,661 INFO L241 hiAutomatonCegarLoop]: Abstraction has 29 states and 92 transitions. [2023-10-12 17:14:22,661 INFO L430 stractBuchiCegarLoop]: Abstraction has 29 states and 92 transitions. [2023-10-12 17:14:22,661 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:22,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 92 transitions. [2023-10-12 17:14:22,662 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:22,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:22,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:22,662 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:22,662 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:22,663 INFO L748 eck$LassoCheckResult]: Stem: 241#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 239#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 211#[L28, L77-1]don't care [107] L77-1-->L44: 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] 213#[L44, L78, L28]don't care [2023-10-12 17:14:22,663 INFO L750 eck$LassoCheckResult]: Loop: 213#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 213#[L44, L78, L28]don't care [2023-10-12 17:14:22,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:22,663 INFO L85 PathProgramCache]: Analyzing trace with hash 110963, now seen corresponding path program 1 times [2023-10-12 17:14:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:22,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218406395] [2023-10-12 17:14:22,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:22,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2023-10-12 17:14:22,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990568565] [2023-10-12 17:14:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:22,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash 3439982, now seen corresponding path program 1 times [2023-10-12 17:14:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449365805] [2023-10-12 17:14:22,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:22,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:22,725 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:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:22,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449365805] [2023-10-12 17:14:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449365805] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340037664] [2023-10-12 17:14:22,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:22,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:22,797 INFO L87 Difference]: Start difference. First operand 29 states and 92 transitions. cyclomatic complexity: 81 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:14:22,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:22,822 INFO L93 Difference]: Finished difference Result 39 states and 116 transitions. [2023-10-12 17:14:22,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 116 transitions. [2023-10-12 17:14:22,824 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2023-10-12 17:14:22,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 116 transitions. [2023-10-12 17:14:22,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-10-12 17:14:22,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-10-12 17:14:22,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 116 transitions. [2023-10-12 17:14:22,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:22,826 INFO L219 hiAutomatonCegarLoop]: Abstraction has 39 states and 116 transitions. [2023-10-12 17:14:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 116 transitions. [2023-10-12 17:14:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2023-10-12 17:14:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 34 states have internal predecessors, (108), 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:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 108 transitions. [2023-10-12 17:14:22,834 INFO L241 hiAutomatonCegarLoop]: Abstraction has 35 states and 108 transitions. [2023-10-12 17:14:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:22,835 INFO L430 stractBuchiCegarLoop]: Abstraction has 35 states and 108 transitions. [2023-10-12 17:14:22,835 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:22,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 108 transitions. [2023-10-12 17:14:22,837 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:22,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:22,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:22,837 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:22,838 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:22,838 INFO L748 eck$LassoCheckResult]: Stem: 352#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 350#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 318#[L28, L77-1]don't care [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 292#[L77-1, thread1EXIT]don't care [107] L77-1-->L44: 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] 294#[L44, thread1EXIT, L78]don't care [2023-10-12 17:14:22,838 INFO L750 eck$LassoCheckResult]: Loop: 294#[L44, thread1EXIT, L78]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 294#[L44, thread1EXIT, L78]don't care [2023-10-12 17:14:22,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash 3440611, now seen corresponding path program 1 times [2023-10-12 17:14:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:22,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20795729] [2023-10-12 17:14:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:22,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 2 times [2023-10-12 17:14:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140826433] [2023-10-12 17:14:22,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:22,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 106659070, now seen corresponding path program 1 times [2023-10-12 17:14:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588363187] [2023-10-12 17:14:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:22,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:22,917 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:14:23,065 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:23,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:23,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:23,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:23,066 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:23,066 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,066 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:23,066 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:23,066 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:14:23,066 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:23,066 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:23,068 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:23,070 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:23,072 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:23,076 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:23,078 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:23,145 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:23,147 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:23,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:23,331 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:23,331 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:23,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:23,332 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:14:23,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:14:23,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:23,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:23,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:23,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:23,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:23,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:23,364 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:14:23,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:23,384 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:14:23,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:23,386 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:14:23,388 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:14:23,389 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:23,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:23,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:23,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:23,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:23,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:23,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:23,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:23,424 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:14:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:23,425 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:14:23,427 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:14:23,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:23,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:23,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:23,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:23,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:23,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:23,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:23,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:23,455 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:14:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:23,456 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:14:23,467 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:14:23,470 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:23,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:23,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:23,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:23,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:23,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:23,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:23,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:23,511 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:14:23,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:23,512 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:14:23,515 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:14:23,516 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:23,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:23,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:23,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:23,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:23,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:23,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:23,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:23,565 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:14:23,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:23,566 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:14:23,568 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:14:23,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:23,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:23,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:23,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:23,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:23,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:23,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:23,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:23,603 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:23,603 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:23,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:23,609 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:14:23,612 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:14:23,614 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:23,634 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:23,635 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:23,635 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:14:23,641 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:14:23,642 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:23,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:23,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:23,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:23,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:23,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:23,671 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:23,671 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:14:23,671 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 108 transitions. cyclomatic complexity: 93 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:14:23,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 108 transitions. cyclomatic complexity: 93. 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 97 states and 283 transitions. Complement of second has 5 states. [2023-10-12 17:14:23,704 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:14:23,705 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:14:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2023-10-12 17:14:23,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:23,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:23,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:14:23,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:23,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:14:23,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:23,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 283 transitions. [2023-10-12 17:14:23,718 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 20 [2023-10-12 17:14:23,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 77 states and 231 transitions. [2023-10-12 17:14:23,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2023-10-12 17:14:23,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2023-10-12 17:14:23,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 231 transitions. [2023-10-12 17:14:23,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:23,720 INFO L219 hiAutomatonCegarLoop]: Abstraction has 77 states and 231 transitions. [2023-10-12 17:14:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 231 transitions. [2023-10-12 17:14:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2023-10-12 17:14:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 3.30188679245283) internal successors, (175), 52 states have internal predecessors, (175), 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:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 175 transitions. [2023-10-12 17:14:23,728 INFO L241 hiAutomatonCegarLoop]: Abstraction has 53 states and 175 transitions. [2023-10-12 17:14:23,728 INFO L430 stractBuchiCegarLoop]: Abstraction has 53 states and 175 transitions. [2023-10-12 17:14:23,728 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:23,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 175 transitions. [2023-10-12 17:14:23,730 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 15 [2023-10-12 17:14:23,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:23,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:23,730 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:23,730 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:23,731 INFO L748 eck$LassoCheckResult]: Stem: 561#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 557#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 515#[L28, L77-1]don't care [107] L77-1-->L44: 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] 517#[L44, L78, L28]don't care [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 563#[L44, thread1EXIT, L78]don't care [2023-10-12 17:14:23,731 INFO L750 eck$LassoCheckResult]: Loop: 563#[L44, thread1EXIT, L78]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 563#[L44, thread1EXIT, L78]don't care [2023-10-12 17:14:23,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash 3439981, now seen corresponding path program 2 times [2023-10-12 17:14:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:23,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155126883] [2023-10-12 17:14:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:23,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:23,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:23,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:23,741 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 3 times [2023-10-12 17:14:23,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:23,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120968016] [2023-10-12 17:14:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:23,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:23,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:23,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:23,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash 106639540, now seen corresponding path program 2 times [2023-10-12 17:14:23,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:23,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471238732] [2023-10-12 17:14:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:23,754 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:23,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:23,898 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:23,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:23,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:23,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:23,898 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:23,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:23,899 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:23,899 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:23,899 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:14:23,899 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:23,899 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:23,900 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:23,902 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:23,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:14:23,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:14:23,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:14:23,959 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:23,961 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:23,964 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:24,136 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:24,137 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:24,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:24,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:24,138 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:14:24,144 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:24,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:24,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:24,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:24,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:24,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:24,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:24,156 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:14:24,176 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:24,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:24,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:24,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:24,183 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:14:24,198 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:24,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:24,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:24,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:24,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:24,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:24,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:24,213 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:14:24,224 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:24,230 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:24,231 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:24,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:24,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:24,263 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:14:24,271 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:24,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-10-12 17:14:24,286 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:14:24,290 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:24,290 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:24,291 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:14:24,295 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:14:24,296 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:24,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:24,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:24,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:24,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:24,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:24,318 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:24,319 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:14:24,319 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 175 transitions. cyclomatic complexity: 152 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:14:24,345 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 175 transitions. cyclomatic complexity: 152. 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 86 states and 278 transitions. Complement of second has 4 states. [2023-10-12 17:14:24,346 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:14:24,347 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:14:24,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2023-10-12 17:14:24,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:24,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:24,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:14:24,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:24,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:14:24,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:24,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 278 transitions. [2023-10-12 17:14:24,352 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:24,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 64 states and 203 transitions. [2023-10-12 17:14:24,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-10-12 17:14:24,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-10-12 17:14:24,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 203 transitions. [2023-10-12 17:14:24,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:24,354 INFO L219 hiAutomatonCegarLoop]: Abstraction has 64 states and 203 transitions. [2023-10-12 17:14:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 203 transitions. [2023-10-12 17:14:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2023-10-12 17:14:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 47 states have internal predecessors, (161), 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:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 161 transitions. [2023-10-12 17:14:24,368 INFO L241 hiAutomatonCegarLoop]: Abstraction has 48 states and 161 transitions. [2023-10-12 17:14:24,368 INFO L430 stractBuchiCegarLoop]: Abstraction has 48 states and 161 transitions. [2023-10-12 17:14:24,368 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:24,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 161 transitions. [2023-10-12 17:14:24,368 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2023-10-12 17:14:24,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:24,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:24,369 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:24,369 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:24,369 INFO L748 eck$LassoCheckResult]: Stem: 784#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 780#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 740#[L28, L77-1]don't care [107] L77-1-->L44: 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] 744#[L44, L78, L28]don't care [110] L78-->L62: 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] 724#[L62, L79, L44, L28]don't care [2023-10-12 17:14:24,369 INFO L750 eck$LassoCheckResult]: Loop: 724#[L62, L79, L44, L28]don't care [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 724#[L62, L79, L44, L28]don't care [2023-10-12 17:14:24,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,370 INFO L85 PathProgramCache]: Analyzing trace with hash 3439963, now seen corresponding path program 1 times [2023-10-12 17:14:24,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149211002] [2023-10-12 17:14:24,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,382 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:24,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 1 times [2023-10-12 17:14:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154383655] [2023-10-12 17:14:24,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:24,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash 106638980, now seen corresponding path program 1 times [2023-10-12 17:14:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001134112] [2023-10-12 17:14:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:24,408 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:24,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:24,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001134112] [2023-10-12 17:14:24,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001134112] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:24,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:24,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186457323] [2023-10-12 17:14:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:24,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:24,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:24,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:24,446 INFO L87 Difference]: Start difference. First operand 48 states and 161 transitions. cyclomatic complexity: 137 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:14:24,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:24,465 INFO L93 Difference]: Finished difference Result 78 states and 235 transitions. [2023-10-12 17:14:24,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 235 transitions. [2023-10-12 17:14:24,466 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2023-10-12 17:14:24,467 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 65 states and 198 transitions. [2023-10-12 17:14:24,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-10-12 17:14:24,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-10-12 17:14:24,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 198 transitions. [2023-10-12 17:14:24,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:24,467 INFO L219 hiAutomatonCegarLoop]: Abstraction has 65 states and 198 transitions. [2023-10-12 17:14:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 198 transitions. [2023-10-12 17:14:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2023-10-12 17:14:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 3.1666666666666665) internal successors, (190), 59 states have internal predecessors, (190), 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:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 190 transitions. [2023-10-12 17:14:24,470 INFO L241 hiAutomatonCegarLoop]: Abstraction has 60 states and 190 transitions. [2023-10-12 17:14:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:24,471 INFO L430 stractBuchiCegarLoop]: Abstraction has 60 states and 190 transitions. [2023-10-12 17:14:24,471 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:24,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 190 transitions. [2023-10-12 17:14:24,471 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 10 [2023-10-12 17:14:24,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:24,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:24,472 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:24,472 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:24,472 INFO L748 eck$LassoCheckResult]: Stem: 962#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 956#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 918#[L28, L77-1]don't care [107] L77-1-->L44: 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] 920#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 970#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 972#[L44, L78, L28]don't care [2023-10-12 17:14:24,472 INFO L750 eck$LassoCheckResult]: Loop: 972#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 972#[L44, L78, L28]don't care [2023-10-12 17:14:24,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,472 INFO L85 PathProgramCache]: Analyzing trace with hash 106639478, now seen corresponding path program 1 times [2023-10-12 17:14:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34674929] [2023-10-12 17:14:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:24,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 4 times [2023-10-12 17:14:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395579074] [2023-10-12 17:14:24,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:24,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash -989143349, now seen corresponding path program 2 times [2023-10-12 17:14:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763249126] [2023-10-12 17:14:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:24,526 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:14:24,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763249126] [2023-10-12 17:14:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763249126] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:24,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:14:24,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955518347] [2023-10-12 17:14:24,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:24,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:14:24,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:24,579 INFO L87 Difference]: Start difference. First operand 60 states and 190 transitions. cyclomatic complexity: 156 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:14:24,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:24,611 INFO L93 Difference]: Finished difference Result 135 states and 394 transitions. [2023-10-12 17:14:24,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 394 transitions. [2023-10-12 17:14:24,613 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 25 [2023-10-12 17:14:24,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 128 states and 372 transitions. [2023-10-12 17:14:24,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2023-10-12 17:14:24,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2023-10-12 17:14:24,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 372 transitions. [2023-10-12 17:14:24,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:24,615 INFO L219 hiAutomatonCegarLoop]: Abstraction has 128 states and 372 transitions. [2023-10-12 17:14:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 372 transitions. [2023-10-12 17:14:24,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 91. [2023-10-12 17:14:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 3.1868131868131866) internal successors, (290), 90 states have internal predecessors, (290), 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:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 290 transitions. [2023-10-12 17:14:24,619 INFO L241 hiAutomatonCegarLoop]: Abstraction has 91 states and 290 transitions. [2023-10-12 17:14:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:24,619 INFO L430 stractBuchiCegarLoop]: Abstraction has 91 states and 290 transitions. [2023-10-12 17:14:24,619 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:24,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 290 transitions. [2023-10-12 17:14:24,620 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:24,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:24,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:24,620 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:24,621 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:24,621 INFO L748 eck$LassoCheckResult]: Stem: 1233#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1229#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1185#[L28, L77-1]don't care [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 1165#[L77-1, thread1EXIT]don't care [107] L77-1-->L44: 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] 1167#[L44, thread1EXIT, L78]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1235#[L44, thread1EXIT, L78]don't care [110] L78-->L62: 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] 1201#[L62, L79, L44, thread1EXIT]don't care [2023-10-12 17:14:24,621 INFO L750 eck$LassoCheckResult]: Loop: 1201#[L62, L79, L44, thread1EXIT]don't care [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 1201#[L62, L79, L44, thread1EXIT]don't care [2023-10-12 17:14:24,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash -988536016, now seen corresponding path program 1 times [2023-10-12 17:14:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651568062] [2023-10-12 17:14:24,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:24,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 2 times [2023-10-12 17:14:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200878253] [2023-10-12 17:14:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:24,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash -579845297, now seen corresponding path program 1 times [2023-10-12 17:14:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:24,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25683840] [2023-10-12 17:14:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:24,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:24,873 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:24,873 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:24,873 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:24,873 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:24,873 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:24,873 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:24,873 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:24,873 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:24,873 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:14:24,874 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:24,874 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:24,878 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:24,880 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:24,961 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:24,965 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:24,967 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:24,969 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:24,971 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:24,974 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:24,976 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:24,978 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:25,194 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:25,194 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:25,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:25,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:25,196 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:14:25,198 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:14:25,199 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:25,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:25,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:25,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:25,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:25,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:25,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:25,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:25,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:25,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:25,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:25,223 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:14:25,224 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:14:25,226 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:25,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:25,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:25,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:25,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:25,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:25,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:25,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:25,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-10-12 17:14:25,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:25,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:25,254 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:14:25,259 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:14:25,259 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:25,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:25,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:25,267 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:25,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:25,287 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:14:25,288 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:25,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:25,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:25,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:25,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:25,332 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:14:25,332 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:14:25,335 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:25,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:25,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:25,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:25,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:25,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:25,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:25,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:25,378 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:25,378 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:25,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:25,379 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:14:25,380 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:14:25,382 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:25,389 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:25,389 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:25,389 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:14:25,394 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:14:25,401 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:25,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:25,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:25,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:25,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:25,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:25,434 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:25,434 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:14:25,434 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 290 transitions. cyclomatic complexity: 232 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:14:25,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 290 transitions. cyclomatic complexity: 232. 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 196 states and 597 transitions. Complement of second has 5 states. [2023-10-12 17:14:25,461 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:14:25,461 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:14:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2023-10-12 17:14:25,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:25,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:25,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:25,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:25,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:25,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:25,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 597 transitions. [2023-10-12 17:14:25,464 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:25,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 143 states and 417 transitions. [2023-10-12 17:14:25,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-10-12 17:14:25,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2023-10-12 17:14:25,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 417 transitions. [2023-10-12 17:14:25,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:25,466 INFO L219 hiAutomatonCegarLoop]: Abstraction has 143 states and 417 transitions. [2023-10-12 17:14:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 417 transitions. [2023-10-12 17:14:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2023-10-12 17:14:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 3.1121495327102804) internal successors, (333), 106 states have internal predecessors, (333), 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:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 333 transitions. [2023-10-12 17:14:25,470 INFO L241 hiAutomatonCegarLoop]: Abstraction has 107 states and 333 transitions. [2023-10-12 17:14:25,470 INFO L430 stractBuchiCegarLoop]: Abstraction has 107 states and 333 transitions. [2023-10-12 17:14:25,470 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:25,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 333 transitions. [2023-10-12 17:14:25,471 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:25,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:25,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:25,471 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:25,471 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:25,472 INFO L748 eck$LassoCheckResult]: Stem: 1649#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1641#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1605#[L28, L77-1]don't care [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 1587#[L77-1, thread1EXIT]don't care [107] L77-1-->L44: 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] 1589#[L44, thread1EXIT, L78]don't care [110] L78-->L62: 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] 1651#[L62, L79, L44, thread1EXIT]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 1673#[L62, L79, L44, thread1EXIT]don't care [2023-10-12 17:14:25,472 INFO L750 eck$LassoCheckResult]: Loop: 1673#[L62, L79, L44, thread1EXIT]don't care [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 1673#[L62, L79, L44, thread1EXIT]don't care [2023-10-12 17:14:25,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -988536586, now seen corresponding path program 2 times [2023-10-12 17:14:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:25,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812856537] [2023-10-12 17:14:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:25,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:25,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:25,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 3 times [2023-10-12 17:14:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919778081] [2023-10-12 17:14:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:25,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:25,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:25,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:25,486 INFO L85 PathProgramCache]: Analyzing trace with hash -579862967, now seen corresponding path program 2 times [2023-10-12 17:14:25,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:25,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256457346] [2023-10-12 17:14:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:25,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:25,491 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:25,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:25,655 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:14:25,661 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:14:25,753 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:25,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:25,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:25,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:25,753 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:25,753 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:25,753 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:25,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:25,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:14:25,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:25,753 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:25,755 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:25,758 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:25,760 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:25,762 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:25,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:14:25,768 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:25,770 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:25,858 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:25,860 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:25,862 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:26,086 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:26,086 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:26,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,087 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:14:26,089 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:14:26,090 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:26,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,101 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,101 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:26,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-10-12 17:14:26,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,107 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:14:26,109 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:14:26,110 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:26,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:26,132 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:14:26,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,133 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:14:26,142 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:14:26,142 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:26,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:26,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2023-10-12 17:14:26,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,175 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:14:26,176 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:14:26,178 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:26,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:26,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:26,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,211 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:14:26,212 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:14:26,214 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:26,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,222 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:26,226 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:14:26,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,228 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:14:26,228 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:14:26,232 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:26,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:26,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2023-10-12 17:14:26,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,244 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:14:26,246 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:14:26,247 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:26,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:26,269 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:14:26,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,270 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:14:26,271 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:14:26,273 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:26,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:26,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:26,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:26,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:26,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:26,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:26,284 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:26,290 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:26,290 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:26,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,291 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:14:26,293 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:14:26,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:26,301 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:26,301 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:26,301 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:14:26,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:26,308 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:26,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:26,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:26,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:26,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:26,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:26,344 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:26,344 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:14:26,344 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 333 transitions. cyclomatic complexity: 268 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:14:26,369 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 333 transitions. cyclomatic complexity: 268. 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 317 states and 970 transitions. Complement of second has 5 states. [2023-10-12 17:14:26,369 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:14:26,369 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:14:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2023-10-12 17:14:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:26,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 970 transitions. [2023-10-12 17:14:26,373 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:26,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 251 states and 735 transitions. [2023-10-12 17:14:26,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2023-10-12 17:14:26,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2023-10-12 17:14:26,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 735 transitions. [2023-10-12 17:14:26,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:26,376 INFO L219 hiAutomatonCegarLoop]: Abstraction has 251 states and 735 transitions. [2023-10-12 17:14:26,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 735 transitions. [2023-10-12 17:14:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 149. [2023-10-12 17:14:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 3.087248322147651) internal successors, (460), 148 states have internal predecessors, (460), 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:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 460 transitions. [2023-10-12 17:14:26,381 INFO L241 hiAutomatonCegarLoop]: Abstraction has 149 states and 460 transitions. [2023-10-12 17:14:26,381 INFO L430 stractBuchiCegarLoop]: Abstraction has 149 states and 460 transitions. [2023-10-12 17:14:26,381 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:26,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 460 transitions. [2023-10-12 17:14:26,382 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 12 [2023-10-12 17:14:26,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:26,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:26,382 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-10-12 17:14:26,382 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:26,383 INFO L748 eck$LassoCheckResult]: Stem: 2218#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2210#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2180#[L28, L77-1]don't care [107] L77-1-->L44: 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] 2182#[L44, L78, L28]don't care [110] L78-->L62: 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] 2358#[L62, L79, L44, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 2418#[L62, L79, L44, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 2424#[L62, L79, L44, L28]don't care [119] L62-->thread3EXIT: Formula: (not v_g_5) InVars {g=v_g_5} OutVars{g=v_g_5} AuxVars[] AssignedVars[] 2174#[L79, thread3EXIT, L44, L28]don't care [2023-10-12 17:14:26,383 INFO L750 eck$LassoCheckResult]: Loop: 2174#[L79, thread3EXIT, L44, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2174#[L79, thread3EXIT, L44, L28]don't care [2023-10-12 17:14:26,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -599152260, now seen corresponding path program 1 times [2023-10-12 17:14:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060241307] [2023-10-12 17:14:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:14:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060241307] [2023-10-12 17:14:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060241307] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:26,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437248250] [2023-10-12 17:14:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:26,397 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:14:26,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,397 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 5 times [2023-10-12 17:14:26,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675683909] [2023-10-12 17:14:26,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:26,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:26,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:26,456 INFO L87 Difference]: Start difference. First operand 149 states and 460 transitions. cyclomatic complexity: 356 Second operand has 3 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:14:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:26,483 INFO L93 Difference]: Finished difference Result 195 states and 593 transitions. [2023-10-12 17:14:26,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 593 transitions. [2023-10-12 17:14:26,485 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:26,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 593 transitions. [2023-10-12 17:14:26,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2023-10-12 17:14:26,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2023-10-12 17:14:26,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 593 transitions. [2023-10-12 17:14:26,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:26,487 INFO L219 hiAutomatonCegarLoop]: Abstraction has 195 states and 593 transitions. [2023-10-12 17:14:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 593 transitions. [2023-10-12 17:14:26,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 162. [2023-10-12 17:14:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 162 states have (on average 3.0864197530864197) internal successors, (500), 161 states have internal predecessors, (500), 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:26,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 500 transitions. [2023-10-12 17:14:26,491 INFO L241 hiAutomatonCegarLoop]: Abstraction has 162 states and 500 transitions. [2023-10-12 17:14:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:26,494 INFO L430 stractBuchiCegarLoop]: Abstraction has 162 states and 500 transitions. [2023-10-12 17:14:26,494 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:14:26,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 500 transitions. [2023-10-12 17:14:26,495 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2023-10-12 17:14:26,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:26,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:26,495 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2023-10-12 17:14:26,495 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:26,496 INFO L748 eck$LassoCheckResult]: Stem: 2713#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2711#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2679#[L28, L77-1]don't care [107] L77-1-->L44: 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] 2681#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 2911#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 2825#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2887#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2891#[L44, L78, L28]don't care [2023-10-12 17:14:26,496 INFO L750 eck$LassoCheckResult]: Loop: 2891#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 2891#[L44, L78, L28]don't care [2023-10-12 17:14:26,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash -598675501, now seen corresponding path program 3 times [2023-10-12 17:14:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553843033] [2023-10-12 17:14:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:26,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 6 times [2023-10-12 17:14:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487689268] [2023-10-12 17:14:26,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:26,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1379071218, now seen corresponding path program 4 times [2023-10-12 17:14:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674141243] [2023-10-12 17:14:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:26,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674141243] [2023-10-12 17:14:26,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674141243] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:14:26,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618528256] [2023-10-12 17:14:26,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:14:26,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:14:26,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:26,557 INFO L229 MonitoredProcess]: Starting monitored process 36 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:26,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-10-12 17:14:26,596 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:14:26,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:14:26,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:14:26,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:26,625 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:14:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618528256] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:14:26,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:14:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2023-10-12 17:14:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208147135] [2023-10-12 17:14:26,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:14:26,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:26,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-10-12 17:14:26,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-10-12 17:14:26,700 INFO L87 Difference]: Start difference. First operand 162 states and 500 transitions. cyclomatic complexity: 388 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:26,746 INFO L93 Difference]: Finished difference Result 335 states and 1012 transitions. [2023-10-12 17:14:26,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 335 states and 1012 transitions. [2023-10-12 17:14:26,749 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 35 [2023-10-12 17:14:26,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 335 states to 322 states and 972 transitions. [2023-10-12 17:14:26,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2023-10-12 17:14:26,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2023-10-12 17:14:26,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 322 states and 972 transitions. [2023-10-12 17:14:26,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:26,751 INFO L219 hiAutomatonCegarLoop]: Abstraction has 322 states and 972 transitions. [2023-10-12 17:14:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states and 972 transitions. [2023-10-12 17:14:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2023-10-12 17:14:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 243 states have (on average 3.05761316872428) internal successors, (743), 242 states have internal predecessors, (743), 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:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 743 transitions. [2023-10-12 17:14:26,757 INFO L241 hiAutomatonCegarLoop]: Abstraction has 243 states and 743 transitions. [2023-10-12 17:14:26,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-10-12 17:14:26,757 INFO L430 stractBuchiCegarLoop]: Abstraction has 243 states and 743 transitions. [2023-10-12 17:14:26,757 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:14:26,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 743 transitions. [2023-10-12 17:14:26,759 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 14 [2023-10-12 17:14:26,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:26,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:26,759 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:26,759 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:26,760 INFO L748 eck$LassoCheckResult]: Stem: 3435#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 3427#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3391#[L28, L77-1]don't care [107] L77-1-->L44: 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] 3393#[L44, L78, L28]don't care [110] L78-->L62: 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] 3663#[L62, L79, L44, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 3823#[L62, L79, L44, L28]don't care [128] L28-->thread1EXIT: Formula: (and (= (select v_q1_24 v_q1_back_44) 0) (<= v_N_14 v_i_18) (= (+ 1 v_q1_back_44) v_q1_back_43)) InVars {q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_44} OutVars{q1=v_q1_24, N=v_N_14, i=v_i_18, q1_back=v_q1_back_43} AuxVars[] AssignedVars[q1_back] 3403#[L62, L79, L44, thread1EXIT]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 3405#[L62, L79, L44, thread1EXIT]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 3411#[L62, L79, L44, thread1EXIT]don't care [2023-10-12 17:14:26,760 INFO L750 eck$LassoCheckResult]: Loop: 3411#[L62, L79, L44, thread1EXIT]don't care [127] L62-->L62: Formula: (and (= (+ v_q2_front_25 1) v_q2_front_24) (or (and v_g_15 (< 0 v_k_16)) (and (not v_g_15) (<= v_k_16 0))) v_g_16 (< v_q2_front_25 v_q2_back_28) (= v_t_13 (+ v_k_16 v_t_14)) (= (select v_q2_17 v_q2_front_25) v_k_16)) InVars {q2=v_q2_17, q2_back=v_q2_back_28, g=v_g_16, t=v_t_14, q2_front=v_q2_front_25} OutVars{q2=v_q2_17, k=v_k_16, q2_back=v_q2_back_28, g=v_g_15, t=v_t_13, q2_front=v_q2_front_24} AuxVars[] AssignedVars[k, g, t, q2_front] 3411#[L62, L79, L44, thread1EXIT]don't care [2023-10-12 17:14:26,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1393848515, now seen corresponding path program 1 times [2023-10-12 17:14:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337135897] [2023-10-12 17:14:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:26,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 4 times [2023-10-12 17:14:26,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784233656] [2023-10-12 17:14:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,775 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:26,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -259630878, now seen corresponding path program 1 times [2023-10-12 17:14:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388832759] [2023-10-12 17:14:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:26,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:26,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:27,132 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:27,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:27,132 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:27,132 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:27,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:27,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:27,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:27,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration11_Lasso [2023-10-12 17:14:27,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:27,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:27,134 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:27,146 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:27,149 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:27,153 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:27,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:27,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:27,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:27,163 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:27,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:14:27,270 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:27,509 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:27,509 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:27,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,510 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:14:27,511 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:14:27,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:27,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:27,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,532 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:14:27,533 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:14:27,535 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:27,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,563 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:14:27,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,569 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:14:27,571 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:14:27,572 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:27,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,580 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,605 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:14:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,606 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:14:27,612 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:27,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,623 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:14:27,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,637 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:14:27,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,639 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:14:27,640 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:14:27,642 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:27,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,649 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2023-10-12 17:14:27,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,658 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:14:27,659 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:14:27,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:14:27,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2023-10-12 17:14:27,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,681 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:14:27,682 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:14:27,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:14:27,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,691 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,691 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2023-10-12 17:14:27,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,697 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:14:27,697 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:14:27,700 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:27,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,706 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:27,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,721 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:14:27,721 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:27,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:27,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2023-10-12 17:14:27,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,749 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:14:27,749 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:14:27,752 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:27,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:27,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:27,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:27,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:27,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:27,759 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:27,763 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:27,768 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:27,768 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:27,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:27,769 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:14:27,769 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:14:27,773 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:27,780 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:27,780 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:27,780 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2023-10-12 17:14:27,782 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:14:27,802 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:14:27,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:27,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:27,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:27,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:27,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:27,830 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:27,830 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:14:27,830 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 243 states and 743 transitions. cyclomatic complexity: 560 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:14:27,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 243 states and 743 transitions. cyclomatic complexity: 560. 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 428 states and 1225 transitions. Complement of second has 5 states. [2023-10-12 17:14:27,849 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:14:27,849 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:14:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-10-12 17:14:27,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:27,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:27,849 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:27,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:27,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:27,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:27,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:27,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:27,874 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:27,874 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:14:27,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 243 states and 743 transitions. cyclomatic complexity: 560 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:14:27,891 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 243 states and 743 transitions. cyclomatic complexity: 560. 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 428 states and 1225 transitions. Complement of second has 5 states. [2023-10-12 17:14:27,891 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:14:27,891 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:14:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-10-12 17:14:27,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:27,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:27,892 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:27,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:27,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:27,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:27,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:27,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:27,917 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:27,917 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:14:27,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 243 states and 743 transitions. cyclomatic complexity: 560 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:14:27,946 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 243 states and 743 transitions. cyclomatic complexity: 560. 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 499 states and 1551 transitions. Complement of second has 5 states. [2023-10-12 17:14:27,946 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:14:27,947 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:14:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2023-10-12 17:14:27,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:27,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:27,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:27,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:27,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:27,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:27,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 499 states and 1551 transitions. [2023-10-12 17:14:27,952 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2023-10-12 17:14:27,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 499 states to 166 states and 455 transitions. [2023-10-12 17:14:27,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-10-12 17:14:27,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-10-12 17:14:27,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 455 transitions. [2023-10-12 17:14:27,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:27,954 INFO L219 hiAutomatonCegarLoop]: Abstraction has 166 states and 455 transitions. [2023-10-12 17:14:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 455 transitions. [2023-10-12 17:14:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 77. [2023-10-12 17:14:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.74025974025974) internal successors, (211), 76 states have internal predecessors, (211), 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:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 211 transitions. [2023-10-12 17:14:27,956 INFO L241 hiAutomatonCegarLoop]: Abstraction has 77 states and 211 transitions. [2023-10-12 17:14:27,956 INFO L430 stractBuchiCegarLoop]: Abstraction has 77 states and 211 transitions. [2023-10-12 17:14:27,956 INFO L337 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-10-12 17:14:27,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 211 transitions. [2023-10-12 17:14:27,957 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-10-12 17:14:27,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:27,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:27,957 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 1, 1, 1, 1] [2023-10-12 17:14:27,957 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2] [2023-10-12 17:14:27,957 INFO L748 eck$LassoCheckResult]: Stem: 5366#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 5368#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 5356#[L28, L77-1]don't care [107] L77-1-->L44: 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] 5358#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 5378#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 5386#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 5380#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5370#[L44, L78, L28]don't care [2023-10-12 17:14:27,957 INFO L750 eck$LassoCheckResult]: Loop: 5370#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5372#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5370#[L44, L78, L28]don't care [2023-10-12 17:14:27,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash -598675594, now seen corresponding path program 5 times [2023-10-12 17:14:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982366722] [2023-10-12 17:14:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:27,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:27,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:27,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:27,966 INFO L85 PathProgramCache]: Analyzing trace with hash 5089, now seen corresponding path program 7 times [2023-10-12 17:14:27,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:27,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446155167] [2023-10-12 17:14:27,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:27,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:27,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:27,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash 198375958, now seen corresponding path program 6 times [2023-10-12 17:14:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:27,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241966343] [2023-10-12 17:14:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:27,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:27,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:27,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:28,229 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:14:28,321 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:28,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:28,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:28,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:28,322 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:28,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:28,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:28,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:28,322 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration12_Lasso [2023-10-12 17:14:28,322 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:28,322 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:28,323 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:28,481 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:28,483 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:28,484 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:28,487 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:28,489 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:28,490 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:28,492 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:28,774 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:28,774 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:28,775 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:14:28,776 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:14:28,778 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:28,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:28,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:28,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:28,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:28,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:28,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:28,804 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:28,815 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:28,816 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:28,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:28,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:28,817 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:14:28,819 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:14:28,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:28,826 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:28,826 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:28,827 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:14:28,829 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:14:28,831 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:28,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:28,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:28,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:28,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:28,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:28,879 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:14:28,879 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:28,879 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 211 transitions. cyclomatic complexity: 154 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:28,894 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 211 transitions. cyclomatic complexity: 154. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 163 states and 407 transitions. Complement of second has 5 states. [2023-10-12 17:14:28,894 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:14:28,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-10-12 17:14:28,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:28,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:28,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:28,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:28,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:14:28,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:28,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 407 transitions. [2023-10-12 17:14:28,896 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-10-12 17:14:28,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 119 states and 314 transitions. [2023-10-12 17:14:28,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-10-12 17:14:28,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2023-10-12 17:14:28,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 314 transitions. [2023-10-12 17:14:28,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:28,897 INFO L219 hiAutomatonCegarLoop]: Abstraction has 119 states and 314 transitions. [2023-10-12 17:14:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 314 transitions. [2023-10-12 17:14:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2023-10-12 17:14:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 2.6627906976744184) internal successors, (229), 85 states have internal predecessors, (229), 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:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 229 transitions. [2023-10-12 17:14:28,899 INFO L241 hiAutomatonCegarLoop]: Abstraction has 86 states and 229 transitions. [2023-10-12 17:14:28,899 INFO L430 stractBuchiCegarLoop]: Abstraction has 86 states and 229 transitions. [2023-10-12 17:14:28,899 INFO L337 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-10-12 17:14:28,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 229 transitions. [2023-10-12 17:14:28,900 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-10-12 17:14:28,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:28,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:28,900 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2023-10-12 17:14:28,900 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [2] [2023-10-12 17:14:28,900 INFO L748 eck$LassoCheckResult]: Stem: 5734#[$Ultimate##0]don't care [81] $Ultimate##0-->L77: Formula: (and (= 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_f_4 (= v_i_5 v_s_3) (= v_q1_back_8 v_q1_front_5)) InVars {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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{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, t=v_t_1, s=v_s_3, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 5736#[L77]don't care [104] L77-->L28: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 5724#[L28, L77-1]don't care [107] L77-1-->L44: 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] 5726#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 5746#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5818#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 5816#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 5766#[L44, L78, L28]don't care [126] L28-->L28: Formula: (and (< v_i_13 v_N_10) (= (select v_q1_20 v_q1_back_36) 2) (= (+ v_i_13 1) v_i_12) (= (+ 1 v_q1_back_36) v_q1_back_35)) InVars {q1=v_q1_20, N=v_N_10, i=v_i_13, q1_back=v_q1_back_36} OutVars{q1=v_q1_20, N=v_N_10, i=v_i_12, q1_back=v_q1_back_35} AuxVars[] AssignedVars[i, q1_back] 5760#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5740#[L44, L78, L28]don't care [2023-10-12 17:14:28,900 INFO L750 eck$LassoCheckResult]: Loop: 5740#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5738#[L44, L78, L28]don't care [129] L44-->L44: Formula: (and (< v_q1_front_33 v_q1_back_55) (= (+ v_q2_back_31 1) v_q2_back_30) v_f_22 (= v_s_17 (+ v_j_29 v_s_18)) (= v_j_29 (+ (select v_q2_19 v_q2_back_31) 1)) (or (and (< 0 v_j_29) v_f_21) (and (not v_f_21) (<= v_j_29 0))) (= v_q1_front_32 (+ v_q1_front_33 1)) (= (select v_q1_30 v_q1_front_33) v_j_29)) InVars {q1_front=v_q1_front_33, q1=v_q1_30, q2=v_q2_19, q2_back=v_q2_back_31, f=v_f_22, s=v_s_18, q1_back=v_q1_back_55} OutVars{q1_front=v_q1_front_32, q1=v_q1_30, q2=v_q2_19, j=v_j_29, q2_back=v_q2_back_30, f=v_f_21, s=v_s_17, q1_back=v_q1_back_55} AuxVars[] AssignedVars[q1_front, j, q2_back, f, s] 5740#[L44, L78, L28]don't care [2023-10-12 17:14:28,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:28,901 INFO L85 PathProgramCache]: Analyzing trace with hash 201143545, now seen corresponding path program 7 times [2023-10-12 17:14:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:28,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583670753] [2023-10-12 17:14:28,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:28,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:28,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:28,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:28,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:28,914 INFO L85 PathProgramCache]: Analyzing trace with hash 5089, now seen corresponding path program 8 times [2023-10-12 17:14:28,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:28,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275544174] [2023-10-12 17:14:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:28,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:28,924 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:28,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash 25422553, now seen corresponding path program 8 times [2023-10-12 17:14:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:28,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920380008] [2023-10-12 17:14:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:28,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:28,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:28,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:29,379 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:29,380 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:29,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:29,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:29,380 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:29,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:29,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:29,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: horseshoe.wvr.bpl_BEv2_Iteration13_Lasso [2023-10-12 17:14:29,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:29,380 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:29,381 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:29,383 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:29,387 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:29,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2023-10-12 17:14:29,569 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:29,571 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:29,572 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:29,575 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:29,577 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:29,867 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:29,867 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:29,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:29,868 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:14:29,869 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:14:29,871 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:29,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:29,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:29,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:29,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:29,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:29,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:29,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:29,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2023-10-12 17:14:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:29,884 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:14:29,885 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:14:29,886 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:29,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:29,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:29,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:29,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:29,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:29,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:29,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:29,898 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:14:29,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:29,962 INFO L229 MonitoredProcess]: Starting monitored process 51 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:29,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2023-10-12 17:14:29,965 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:29,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:29,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:29,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:29,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:29,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:29,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:29,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:29,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2023-10-12 17:14:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:29,987 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:14:29,989 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:14:29,990 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:29,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:29,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:29,997 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:29,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:30,015 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:14:30,015 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:30,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:30,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:30,062 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:14:30,069 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:30,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:30,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:30,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:30,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:30,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:30,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:30,084 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:14:30,086 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:30,091 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:30,091 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:14:30,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:30,093 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:14:30,097 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:14:30,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:30,119 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:30,119 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:30,119 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:14:30,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:30,136 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2023-10-12 17:14:30,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,175 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:14:30,176 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:30,176 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 229 transitions. cyclomatic complexity: 165 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:30,193 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 229 transitions. cyclomatic complexity: 165. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 117 states and 289 transitions. Complement of second has 5 states. [2023-10-12 17:14:30,194 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:14:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-10-12 17:14:30,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:30,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,195 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:30,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,229 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:14:30,230 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:30,230 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 229 transitions. cyclomatic complexity: 165 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:30,241 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 229 transitions. cyclomatic complexity: 165. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 117 states and 289 transitions. Complement of second has 5 states. [2023-10-12 17:14:30,242 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:14:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-10-12 17:14:30,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:30,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,242 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:30,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,276 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:14:30,276 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 2 loop predicates [2023-10-12 17:14:30,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 229 transitions. cyclomatic complexity: 165 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:30,290 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 229 transitions. cyclomatic complexity: 165. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 150 states and 374 transitions. Complement of second has 4 states. [2023-10-12 17:14:30,291 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:14:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2023-10-12 17:14:30,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:30,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:30,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:14:30,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 374 transitions. [2023-10-12 17:14:30,294 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:30,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 0 states and 0 transitions. [2023-10-12 17:14:30,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:30,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:30,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:30,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:30,294 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:30,295 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:30,295 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:30,295 INFO L337 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2023-10-12 17:14:30,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:30,295 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:30,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:30,299 INFO L201 PluginConnector]: Adding new model horseshoe.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:30 BoogieIcfgContainer [2023-10-12 17:14:30,299 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:30,299 INFO L158 Benchmark]: Toolchain (without parser) took 9716.46ms. Allocated memory was 179.3MB in the beginning and 291.5MB in the end (delta: 112.2MB). Free memory was 131.8MB in the beginning and 162.9MB in the end (delta: -31.1MB). Peak memory consumption was 82.2MB. Max. memory is 8.0GB. [2023-10-12 17:14:30,299 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 179.3MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:30,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.52ms. Allocated memory is still 179.3MB. Free memory was 131.5MB in the beginning and 130.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:30,300 INFO L158 Benchmark]: Boogie Preprocessor took 33.36ms. Allocated memory is still 179.3MB. Free memory was 130.0MB in the beginning and 129.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:30,300 INFO L158 Benchmark]: RCFGBuilder took 287.59ms. Allocated memory is still 179.3MB. Free memory was 129.0MB in the beginning and 117.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:14:30,300 INFO L158 Benchmark]: BuchiAutomizer took 9372.27ms. Allocated memory was 179.3MB in the beginning and 291.5MB in the end (delta: 112.2MB). Free memory was 117.8MB in the beginning and 162.9MB in the end (delta: -45.2MB). Peak memory consumption was 68.6MB. Max. memory is 8.0GB. [2023-10-12 17:14:30,301 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.25ms. Allocated memory is still 179.3MB. Free memory is still 132.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.52ms. Allocated memory is still 179.3MB. Free memory was 131.5MB in the beginning and 130.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.36ms. Allocated memory is still 179.3MB. Free memory was 130.0MB in the beginning and 129.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 287.59ms. Allocated memory is still 179.3MB. Free memory was 129.0MB in the beginning and 117.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 9372.27ms. Allocated memory was 179.3MB in the beginning and 291.5MB in the end (delta: 112.2MB). Free memory was 117.8MB in the beginning and 162.9MB in the end (delta: -45.2MB). Peak memory consumption was 68.6MB. 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 13 terminating modules (5 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 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 q2_back + -1 * q2_front and consists of 3 locations. One deterministic 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 -1 * q1_front + q1_back and consists of 3 locations. 5 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.2s and 14 iterations. TraceHistogramMax:4. Analysis of lassos took 7.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 468 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 17 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU1 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax100 hnf100 lsp77 ukn90 mio100 lsp69 div100 bol111 ite100 ukn100 eq177 hnf90 smp100 dnf194 smp68 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 71ms VariablesStem: 11 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - 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.6s, 37 PlacesBefore, 22 PlacesAfterwards, 30 TransitionsBefore, 15 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 277 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 258, independent: 253, independent conditional: 0, independent unconditional: 253, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 203, independent: 198, independent conditional: 0, independent unconditional: 198, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 203, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 258, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 203, unknown conditional: 0, unknown unconditional: 203] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, 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:30,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2023-10-12 17:14:30,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:30,723 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...