/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:03,370 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:03,426 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:37:03,451 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:03,451 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:03,452 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:03,453 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:03,454 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:03,454 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:03,457 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:03,457 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:03,457 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:03,457 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:03,458 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:03,458 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:03,458 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:03,458 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:03,459 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:03,459 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:03,459 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:03,459 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:03,460 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:03,461 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:03,461 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:03,461 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:03,461 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:03,461 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:03,461 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:03,461 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:03,462 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:03,462 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:03,462 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:03,463 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:03,464 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:03,464 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 -> RABIN_PETRI_NET [2023-10-12 17:37:03,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:03,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:03,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:03,666 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:03,666 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:03,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl [2023-10-12 17:37:03,668 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl' [2023-10-12 17:37:03,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:03,688 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:03,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:03,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:03,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:03,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,710 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:03,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:03,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:03,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:03,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:03,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:03,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:03,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:03,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:03,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:03,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:03,780 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:37:03,803 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:37:03,825 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:03,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:03,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:03,828 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2023-10-12 17:37:03,828 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-10-12 17:37:03,829 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-10-12 17:37:03,829 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:37:03,868 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:03,870 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:03,979 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:03,983 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:03,983 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:03,984 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:03 BoogieIcfgContainer [2023-10-12 17:37:03,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:03,985 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:03,985 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:03,991 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:03,991 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:03,992 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/2) ... [2023-10-12 17:37:03,992 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7da816a0 and model type max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:03, skipping insertion in model container [2023-10-12 17:37:03,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:03,993 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:03" (2/2) ... [2023-10-12 17:37:03,997 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum4.bpl [2023-10-12 17:37:04,087 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:37:04,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 144 flow [2023-10-12 17:37:04,140 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2023-10-12 17:37:04,141 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:04,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 4/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-10-12 17:37:04,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 56 transitions, 144 flow [2023-10-12 17:37:04,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 120 flow [2023-10-12 17:37:04,164 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:04,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 48 transitions, 120 flow [2023-10-12 17:37:04,187 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 48 transitions, 120 flow [2023-10-12 17:37:04,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 120 flow [2023-10-12 17:37:04,207 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2023-10-12 17:37:04,208 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:04,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 4/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-10-12 17:37:04,211 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-10-12 17:37:04,709 INFO L134 LiptonReduction]: Checked pairs total: 906 [2023-10-12 17:37:04,709 INFO L136 LiptonReduction]: Total number of compositions: 25 [2023-10-12 17:37:04,718 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:04,718 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:04,718 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:04,719 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:04,719 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:04,719 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:04,719 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:04,719 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:04,719 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:37:04,722 ERROR L47 etriNetUnfolderRabin]: [1:1A:[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][6], 2:2A:[84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][0], 4:3A:[120] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork0_i_27 v_sumThread1of1ForFork0_lo_5) (= 0 v_sumThread1of1ForFork0_x_21) (= 0 v_sumThread1of1ForFork0_z_13)) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_21, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_13, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_27, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][17]][5:4A:[122] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (+ (select v_A_25 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (let ((.cse0 (+ (select v_A_25 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_25, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_24, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_16, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_30} OutVars{A=v_A_25, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_23, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_15, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_29} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][22]] [2023-10-12 17:37:04,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:04,724 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:04,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:04,725 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:04,727 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:04,727 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:37:04,728 ERROR L47 etriNetUnfolderRabin]: [1:1A:[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][6], 2:2A:[84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][0], 4:3A:[120] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork0_i_27 v_sumThread1of1ForFork0_lo_5) (= 0 v_sumThread1of1ForFork0_x_21) (= 0 v_sumThread1of1ForFork0_z_13)) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_21, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_13, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_27, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][17]][5:4A:[122] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (+ (select v_A_25 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (let ((.cse0 (+ (select v_A_25 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_25, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_24, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_16, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_30} OutVars{A=v_A_25, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_23, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_15, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_29} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][22]] [2023-10-12 17:37:04,728 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:04,728 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:04,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:04,729 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:04,732 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 69#[L54-1, $Ultimate##0]true [120] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork0_i_27 v_sumThread1of1ForFork0_lo_5) (= 0 v_sumThread1of1ForFork0_x_21) (= 0 v_sumThread1of1ForFork0_z_13)) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_21, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_13, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_27, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i] 71#[L54-1, L31-1]true [2023-10-12 17:37:04,733 INFO L750 eck$LassoCheckResult]: Loop: 71#[L54-1, L31-1]true [122] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (+ (select v_A_25 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (let ((.cse0 (+ (select v_A_25 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_25, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_24, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_16, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_30} OutVars{A=v_A_25, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_23, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_15, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_29} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i] 71#[L54-1, L31-1]true [2023-10-12 17:37:04,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash 73838, now seen corresponding path program 1 times [2023-10-12 17:37:04,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511580293] [2023-10-12 17:37:04,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,871 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2023-10-12 17:37:04,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727734563] [2023-10-12 17:37:04,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2289100, now seen corresponding path program 1 times [2023-10-12 17:37:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209250780] [2023-10-12 17:37:04,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,065 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:05,066 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:05,066 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:05,066 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:05,066 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:05,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:05,067 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:05,067 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:05,067 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:05,067 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:05,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:37:05,102 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:37:05,104 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:37:05,244 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:05,247 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:05,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,251 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:37:05,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:37:05,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,273 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:37:05,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,301 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:37:05,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,303 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:37:05,310 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:37:05,311 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:37:05,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,346 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:37:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,347 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:37:05,349 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:37:05,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:37:05,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,379 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:05,394 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-10-12 17:37:05,394 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2023-10-12 17:37:05,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,398 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:37:05,399 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:37:05,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:05,421 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:05,421 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:05,422 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_hi, sumThread1of1ForFork0_i) = 1*sumThread1of1ForFork0_hi - 1*sumThread1of1ForFork0_i Supporting invariants [] [2023-10-12 17:37:05,438 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:37:05,441 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:05,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:05,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:05,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:05,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:05,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:05,484 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:37:05,516 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:37:05,649 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:37:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 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:37:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2023-10-12 17:37:05,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:05,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:05,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:05,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,658 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 92 transitions, 464 flow [2023-10-12 17:37:05,658 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:05,658 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 92 transitions, 464 flow [2023-10-12 17:37:05,660 ERROR L47 etriNetUnfolderRabin]: [1:1A:[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][26], 2:2A:[84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][2], 3:3A:[87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo][22], 7:4A:[116] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork1_z_17) (= v_sumThread1of1ForFork1_lo_5 v_sumThread1of1ForFork1_i_25) (= 0 v_sumThread1of1ForFork1_x_17)) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_17, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_25, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_17, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x][66]][9:5A:[119] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_28 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_21 v_sumThread1of1ForFork1_i_28) v_sumThread1of1ForFork1_x_20) v_sumThread1of1ForFork1_x_19) (= (let ((.cse0 (+ (select v_A_21 v_sumThread1of1ForFork1_i_27) v_sumThread1of1ForFork1_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_19) (= (+ v_sumThread1of1ForFork1_i_28 1) v_sumThread1of1ForFork1_i_27)) InVars {A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_20, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_28, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_20} OutVars{A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_19, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_27, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_19} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x][82]] [2023-10-12 17:37:05,661 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:05,661 INFO L124 PetriNetUnfolderBase]: 2/8 cut-off events. [2023-10-12 17:37:05,661 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:05,661 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:05,661 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 69#[L54-1, $Ultimate##0]true [87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 111#[$Ultimate##0, $Ultimate##0, L55]true [116] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork1_z_17) (= v_sumThread1of1ForFork1_lo_5 v_sumThread1of1ForFork1_i_25) (= 0 v_sumThread1of1ForFork1_x_17)) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_17, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_25, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_17, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 113#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:37:05,662 INFO L750 eck$LassoCheckResult]: Loop: 113#[L31-1, $Ultimate##0, L55]true [119] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_28 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_21 v_sumThread1of1ForFork1_i_28) v_sumThread1of1ForFork1_x_20) v_sumThread1of1ForFork1_x_19) (= (let ((.cse0 (+ (select v_A_21 v_sumThread1of1ForFork1_i_27) v_sumThread1of1ForFork1_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_19) (= (+ v_sumThread1of1ForFork1_i_28 1) v_sumThread1of1ForFork1_i_27)) InVars {A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_20, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_28, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_20} OutVars{A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_19, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_27, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_19} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 113#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:37:05,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2288071, now seen corresponding path program 1 times [2023-10-12 17:37:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567790636] [2023-10-12 17:37:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 150, now seen corresponding path program 1 times [2023-10-12 17:37:05,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073115233] [2023-10-12 17:37:05,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 70930320, now seen corresponding path program 1 times [2023-10-12 17:37:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258976504] [2023-10-12 17:37:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,720 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,860 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:05,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:05,860 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:05,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:05,861 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:05,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:05,861 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:05,861 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:05,861 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:05,861 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:05,864 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:37:05,866 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:37:05,869 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:37:05,871 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:37:05,913 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:37:05,916 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:37:05,919 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:37:05,920 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:37:06,056 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:06,057 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:06,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,058 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:37:06,060 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:37:06,101 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:37:06,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:06,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:06,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:06,110 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,113 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:37:06,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,114 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:37:06,130 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:37:06,130 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:37:06,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,163 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:37:06,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,177 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:37:06,201 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:37:06,202 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:37:06,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,238 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:37:06,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,252 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:37:06,255 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:37:06,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:06,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,270 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,270 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:06,293 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:06,293 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:37:06,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,308 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:37:06,308 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:37:06,364 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:06,385 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:06,385 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:06,385 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_hi, sumThread1of1ForFork1_i) = 1*sumThread1of1ForFork1_hi - 1*sumThread1of1ForFork1_i Supporting invariants [] [2023-10-12 17:37:06,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-10-12 17:37:06,403 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:06,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:06,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:06,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:06,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:06,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:06,429 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:37:06,430 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:37:06,519 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:37:06,519 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:37:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2023-10-12 17:37:06,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:06,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:06,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:06,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:06,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:06,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:06,521 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 368 transitions, 2592 flow [2023-10-12 17:37:06,521 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:06,521 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 40 places, 368 transitions, 2592 flow [2023-10-12 17:37:06,526 ERROR L47 etriNetUnfolderRabin]: [1:1A:[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][105], 2:2A:[84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][9], 3:3A:[87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo][89], 6:4A:[90] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi][153], 20:5A:[117] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork2_z_17) (= 0 v_sumThread1of1ForFork2_x_17) (= v_sumThread1of1ForFork2_i_25 v_sumThread1of1ForFork2_lo_5)) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_5} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_17, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_25, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_17, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x][249]][22:6A:[118] L31-1-->L31-1: Formula: (and (= (+ (select v_A_19 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_x_20) v_sumThread1of1ForFork2_x_19) (= (let ((.cse0 (+ v_sumThread1of1ForFork2_z_20 (select v_A_19 v_sumThread1of1ForFork2_i_27)))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_i_27) (< v_sumThread1of1ForFork2_i_28 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_28, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_20, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_27, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_19, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x][345]] [2023-10-12 17:37:06,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:06,526 INFO L124 PetriNetUnfolderBase]: 9/21 cut-off events. [2023-10-12 17:37:06,526 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:37:06,526 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:06,527 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 69#[L54-1, $Ultimate##0]true [87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 111#[$Ultimate##0, $Ultimate##0, L55]true [90] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi] 151#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [117] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork2_z_17) (= 0 v_sumThread1of1ForFork2_x_17) (= v_sumThread1of1ForFork2_i_25 v_sumThread1of1ForFork2_lo_5)) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_5} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_17, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_25, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_17, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 153#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:37:06,527 INFO L750 eck$LassoCheckResult]: Loop: 153#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [118] L31-1-->L31-1: Formula: (and (= (+ (select v_A_19 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_x_20) v_sumThread1of1ForFork2_x_19) (= (let ((.cse0 (+ v_sumThread1of1ForFork2_z_20 (select v_A_19 v_sumThread1of1ForFork2_i_27)))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_i_27) (< v_sumThread1of1ForFork2_i_28 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_28, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_20, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_27, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_19, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 153#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:37:06,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 70929512, now seen corresponding path program 1 times [2023-10-12 17:37:06,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:06,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782692488] [2023-10-12 17:37:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:06,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:37:06,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589420839] [2023-10-12 17:37:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:06,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2096152306, now seen corresponding path program 1 times [2023-10-12 17:37:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:06,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762903645] [2023-10-12 17:37:06,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:06,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:06,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:37:06,664 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:37:06,736 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:06,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:06,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:06,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:06,736 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:06,736 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,736 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:06,737 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:06,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:37:06,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:06,737 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:06,738 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:37:06,740 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:37:06,742 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:37:06,744 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:37:06,746 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:37:06,748 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:37:06,750 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:37:06,752 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:37:06,753 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:37:06,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:37:06,757 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:37:06,802 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:37:06,804 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:37:06,805 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:37:06,966 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:06,967 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:06,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,981 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:37:06,991 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:37:06,991 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:37:06,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:06,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:06,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:07,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,024 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:37:07,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,026 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:37:07,027 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:37:07,029 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:37:07,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:07,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:07,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:07,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,066 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:37:07,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,068 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:37:07,070 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:37:07,071 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:37:07,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,111 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:37:07,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,112 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:37:07,128 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:37:07,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,128 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:37:07,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,157 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:37:07,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,177 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:37:07,178 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:37:07,180 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:37:07,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,188 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,188 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,214 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:37:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,219 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:37:07,221 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:37:07,223 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:37:07,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:37:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,253 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:37:07,294 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:37:07,295 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:37:07,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,318 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:37:07,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,319 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:37:07,321 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:37:07,322 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:37:07,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:07,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:07,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:07,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,335 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:37:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,338 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:37:07,339 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:37:07,341 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:37:07,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:07,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:07,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:07,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,351 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:37:07,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,353 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:37:07,354 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:37:07,356 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:37:07,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,387 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,392 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:37:07,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,394 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:37:07,401 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:37:07,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,407 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:07,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,413 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:07,414 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:07,424 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:37:07,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,451 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:37:07,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,463 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:37:07,509 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:37:07,509 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:37:07,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:07,570 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:07,571 INFO L444 ModelExtractionUtils]: 10 out of 34 variables were initially zero. Simplification set additionally 21 variables to zero. [2023-10-12 17:37:07,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,572 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:37:07,576 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:37:07,578 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:07,599 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:07,599 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:07,599 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i, sumThread1of1ForFork2_hi) = -1*sumThread1of1ForFork2_i + 1*sumThread1of1ForFork2_hi Supporting invariants [] [2023-10-12 17:37:07,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:37:07,603 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:07,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:07,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:07,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:07,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:07,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:07,631 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:37:07,631 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:37:07,718 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:37:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:37:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2023-10-12 17:37:07,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:07,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:07,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:07,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:07,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:07,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:07,720 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 1472 transitions, 13312 flow [2023-10-12 17:37:07,720 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:07,720 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 1472 transitions, 13312 flow [2023-10-12 17:37:07,735 ERROR L47 etriNetUnfolderRabin]: [1:1A:[43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][422], 2:2A:[84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][38], 3:3A:[87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo][358], 6:4A:[90] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi][614], 18:5A:[93] L56-->$Ultimate##0: Formula: (and (= v_N_3 v_sumThread1of1ForFork3_hi_6) (= (+ v_ULTIMATE.start_k3_5 1) v_sumThread1of1ForFork3_lo_4) (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {N=v_N_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5} OutVars{N=v_N_3, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_16, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_8, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_8, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_4, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1, sumThread1of1ForFork3_lo, sumThread1of1ForFork3_hi][166], 68:6A:[115] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork3_i_27 v_sumThread1of1ForFork3_lo_7) (= 0 v_sumThread1of1ForFork3_z_17) (= 0 v_sumThread1of1ForFork3_x_15)) InVars {sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_7} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_27, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_15, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_17, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_7} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z][1254]][69:7A:[121] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_23 v_sumThread1of1ForFork3_i_29) v_sumThread1of1ForFork3_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork3_z_19) (< v_sumThread1of1ForFork3_i_30 v_sumThread1of1ForFork3_hi_11) (= (+ 1 v_sumThread1of1ForFork3_i_30) v_sumThread1of1ForFork3_i_29) (= (+ v_sumThread1of1ForFork3_x_18 (select v_A_23 v_sumThread1of1ForFork3_i_30)) v_sumThread1of1ForFork3_x_17)) InVars {A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_30, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_18, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_20, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} OutVars{A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_29, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_17, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_19, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z][1190]] [2023-10-12 17:37:07,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:07,736 INFO L124 PetriNetUnfolderBase]: 43/68 cut-off events. [2023-10-12 17:37:07,736 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:37:07,736 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:07,739 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 69#[L54-1, $Ultimate##0]true [87] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 111#[$Ultimate##0, $Ultimate##0, L55]true [90] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi] 151#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [93] L56-->$Ultimate##0: Formula: (and (= v_N_3 v_sumThread1of1ForFork3_hi_6) (= (+ v_ULTIMATE.start_k3_5 1) v_sumThread1of1ForFork3_lo_4) (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {N=v_N_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5} OutVars{N=v_N_3, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_16, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_8, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_8, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_4, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1, sumThread1of1ForFork3_lo, sumThread1of1ForFork3_hi] 195#[$Ultimate##0, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [115] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork3_i_27 v_sumThread1of1ForFork3_lo_7) (= 0 v_sumThread1of1ForFork3_z_17) (= 0 v_sumThread1of1ForFork3_x_15)) InVars {sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_7} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_27, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_15, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_17, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_7} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z] 197#[L31-1, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:37:07,739 INFO L750 eck$LassoCheckResult]: Loop: 197#[L31-1, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [121] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_23 v_sumThread1of1ForFork3_i_29) v_sumThread1of1ForFork3_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork3_z_19) (< v_sumThread1of1ForFork3_i_30 v_sumThread1of1ForFork3_hi_11) (= (+ 1 v_sumThread1of1ForFork3_i_30) v_sumThread1of1ForFork3_i_29) (= (+ v_sumThread1of1ForFork3_x_18 (select v_A_23 v_sumThread1of1ForFork3_i_30)) v_sumThread1of1ForFork3_x_17)) InVars {A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_30, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_18, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_20, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} OutVars{A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_29, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_17, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_19, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z] 197#[L31-1, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:37:07,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2096153053, now seen corresponding path program 1 times [2023-10-12 17:37:07,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:07,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548929000] [2023-10-12 17:37:07,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:07,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,762 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:37:07,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:07,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429430021] [2023-10-12 17:37:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:07,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:07,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash -556235082, now seen corresponding path program 1 times [2023-10-12 17:37:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:07,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956723708] [2023-10-12 17:37:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:07,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:08,005 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:08,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:08,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:08,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:08,006 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:08,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:08,006 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:08,006 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:37:08,006 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:08,006 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:08,008 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:37:08,010 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:37:08,012 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:37:08,013 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:37:08,015 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:37:08,017 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:08,019 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:37:08,067 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:37:08,069 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:37:08,071 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:37:08,073 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:08,075 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:37:08,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:37:08,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:37:08,080 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:37:08,082 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:37:08,084 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:37:08,086 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:37:08,088 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:37:08,090 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:37:08,092 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:37:08,286 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:08,286 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,299 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:37:08,306 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:37:08,306 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:37:08,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:08,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:08,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:08,313 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,317 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:37:08,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,319 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:37:08,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:08,353 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:37:08,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:08,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:08,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:08,362 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:37:08,370 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,373 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:37:08,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,375 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:37:08,377 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:37:08,378 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:37:08,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:08,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:08,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:08,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,389 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:37:08,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,390 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:37:08,392 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:37:08,393 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:37:08,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:08,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:08,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:08,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,411 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:37:08,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,414 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:37:08,416 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:37:08,417 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:37:08,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:08,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:08,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:08,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2023-10-12 17:37:08,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,438 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:37:08,441 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:37:08,441 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:37:08,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:08,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:08,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:08,484 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:37:08,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,485 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:37:08,487 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:37:08,488 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:37:08,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:08,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:08,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:08,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:08,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:08,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:08,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:08,531 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-10-12 17:37:08,531 INFO L444 ModelExtractionUtils]: 12 out of 40 variables were initially zero. Simplification set additionally 25 variables to zero. [2023-10-12 17:37:08,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:08,532 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:37:08,534 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:37:08,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:08,552 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:08,552 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:08,552 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork3_i, sumThread1of1ForFork3_hi) = -1*sumThread1of1ForFork3_i + 1*sumThread1of1ForFork3_hi Supporting invariants [] [2023-10-12 17:37:08,562 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:37:08,563 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:08,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:08,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:08,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:08,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:08,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:08,589 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:37:08,590 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:37:08,712 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:37:08,713 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:37:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2023-10-12 17:37:08,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 235 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:08,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:08,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 235 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:37:08,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:08,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 235 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:37:08,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:08,714 INFO L430 stractBuchiCegarLoop]: Abstraction has has 48 places, 5888 transitions, 65024 flow [2023-10-12 17:37:08,714 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:37:08,714 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 48 places, 5888 transitions, 65024 flow [2023-10-12 17:37:09,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:09,305 INFO L124 PetriNetUnfolderBase]: 1063/1387 cut-off events. [2023-10-12 17:37:09,305 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-10-12 17:37:09,305 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:09,313 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:09 BoogieIcfgContainer [2023-10-12 17:37:09,313 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:09,314 INFO L158 Benchmark]: Toolchain (without parser) took 5625.48ms. Allocated memory was 179.3MB in the beginning and 307.2MB in the end (delta: 127.9MB). Free memory was 127.4MB in the beginning and 156.4MB in the end (delta: -29.0MB). Peak memory consumption was 139.2MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,314 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.23ms. Allocated memory is still 179.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:09,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.07ms. Allocated memory is still 179.3MB. Free memory was 127.4MB in the beginning and 125.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,315 INFO L158 Benchmark]: Boogie Preprocessor took 18.91ms. Allocated memory is still 179.3MB. Free memory was 125.8MB in the beginning and 124.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,315 INFO L158 Benchmark]: RCFGBuilder took 253.33ms. Allocated memory is still 179.3MB. Free memory was 124.6MB in the beginning and 146.7MB in the end (delta: -22.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,315 INFO L158 Benchmark]: BuchiAutomizer took 5328.09ms. Allocated memory was 179.3MB in the beginning and 307.2MB in the end (delta: 127.9MB). Free memory was 146.5MB in the beginning and 156.4MB in the end (delta: -9.8MB). Peak memory consumption was 159.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:09,317 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.23ms. Allocated memory is still 179.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.07ms. Allocated memory is still 179.3MB. Free memory was 127.4MB in the beginning and 125.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.91ms. Allocated memory is still 179.3MB. Free memory was 125.8MB in the beginning and 124.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 253.33ms. Allocated memory is still 179.3MB. Free memory was 124.6MB in the beginning and 146.7MB in the end (delta: -22.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 5328.09ms. Allocated memory was 179.3MB in the beginning and 307.2MB in the end (delta: 127.9MB). Free memory was 146.5MB in the beginning and 156.4MB in the end (delta: -9.8MB). Peak memory consumption was 159.0MB. 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 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 3.3s. Construction of modules took 0.2s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 622 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 618 mSDsluCounter, 532 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 168 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 364 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp109 ukn67 mio100 lsp57 div100 bol100 ite100 ukn100 eq175 hnf92 smp100 dnf171 smp64 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 2 VariablesLoop: 6 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.5s, 57 PlacesBefore, 32 PlacesAfterwards, 48 TransitionsBefore, 23 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 25 TotalNumberOfCompositions, 906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 906, independent: 906, independent conditional: 0, independent unconditional: 906, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 732, independent: 732, independent conditional: 0, independent unconditional: 732, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 732, independent: 732, independent conditional: 0, independent unconditional: 732, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 906, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 732, unknown conditional: 0, unknown unconditional: 732] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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:37:09,334 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...