/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-tailsum2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:03,009 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:03,081 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,119 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:03,119 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:03,120 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:03,121 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:03,121 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:03,122 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:03,125 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:03,125 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:03,125 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:03,126 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:03,127 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:03,127 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:03,127 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:03,127 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:03,128 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:03,128 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:03,128 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:03,128 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:03,130 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:03,130 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:03,130 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:03,130 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:03,130 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:03,131 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:03,131 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:03,131 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:03,131 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:03,132 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:03,133 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:03,133 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:03,134 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:03,134 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,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:03,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:03,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:03,379 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:03,380 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:03,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl [2023-10-12 17:37:03,381 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl' [2023-10-12 17:37:03,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:03,408 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:03,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:03,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:03,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:03,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,432 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:03,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:03,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:03,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:03,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:03,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:03,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:03,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:03,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:03,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:03,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:03,482 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,494 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,520 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:03,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:03,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2023-10-12 17:37:03,521 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-10-12 17:37:03,521 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-10-12 17:37:03,522 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,574 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:03,575 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:03,637 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:03,643 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:03,643 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:03,644 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:03 BoogieIcfgContainer [2023-10-12 17:37:03,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:03,645 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:03,645 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:03,648 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:03,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:03,649 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/2) ... [2023-10-12 17:37:03,650 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de8b247 and model type max-tailsum2.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,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:03,650 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:03" (2/2) ... [2023-10-12 17:37:03,651 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum2.bpl [2023-10-12 17:37:03,716 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:37:03,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 76 flow [2023-10-12 17:37:03,762 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-10-12 17:37:03,762 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:03,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 2/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:37:03,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 76 flow [2023-10-12 17:37:03,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 64 flow [2023-10-12 17:37:03,774 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:03,799 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 26 transitions, 64 flow [2023-10-12 17:37:03,805 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 64 flow [2023-10-12 17:37:03,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 64 flow [2023-10-12 17:37:03,827 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-10-12 17:37:03,828 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:03,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 2/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:37:03,829 INFO L119 LiptonReduction]: Number of co-enabled transitions 198 [2023-10-12 17:37:04,146 INFO L134 LiptonReduction]: Checked pairs total: 150 [2023-10-12 17:37:04,147 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:37:04,158 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:04,158 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:04,158 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:04,159 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:04,159 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:04,159 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:04,159 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:04,159 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:04,160 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:04,164 ERROR L47 etriNetUnfolderRabin]: [1:1A:[34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][3], 2:2A:[58] 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:[74] $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][11]][5:4A:[76] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_13 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15) (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (+ (select v_A_13 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23)) InVars {A=v_A_13, 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_13, 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][12]] [2023-10-12 17:37:04,165 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:04,166 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:04,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:04,166 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:04,168 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:04,168 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 18 places, 13 transitions, 38 flow [2023-10-12 17:37:04,170 ERROR L47 etriNetUnfolderRabin]: [1:1A:[34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][3], 2:2A:[58] 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:[74] $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][11]][5:4A:[76] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_13 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15) (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (+ (select v_A_13 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23)) InVars {A=v_A_13, 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_13, 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][12]] [2023-10-12 17:37:04,170 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:04,170 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:04,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:04,171 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:04,175 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 39#[L54]true [58] 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] 41#[L54-1, $Ultimate##0]true [74] $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] 43#[L54-1, L31-1]true [2023-10-12 17:37:04,175 INFO L750 eck$LassoCheckResult]: Loop: 43#[L54-1, L31-1]true [76] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_13 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15) (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (+ (select v_A_13 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23)) InVars {A=v_A_13, 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_13, 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] 43#[L54-1, L31-1]true [2023-10-12 17:37:04,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash 64337, now seen corresponding path program 1 times [2023-10-12 17:37:04,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085556540] [2023-10-12 17:37:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,265 INFO L85 PathProgramCache]: Analyzing trace with hash 107, now seen corresponding path program 1 times [2023-10-12 17:37:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137926281] [2023-10-12 17:37:04,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,286 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1994523, now seen corresponding path program 1 times [2023-10-12 17:37:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902089504] [2023-10-12 17:37:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,455 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:04,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:04,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:04,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:04,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:04,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:04,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:04,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:04,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:04,457 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:04,457 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:04,471 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:04,479 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:04,482 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:04,666 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:04,670 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:04,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:04,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:04,674 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:04,676 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:04,677 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:04,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:04,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:04,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:04,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:04,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:04,693 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:04,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:04,717 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:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:04,719 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:04,721 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:04,723 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:04,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:04,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:04,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:04,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:04,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:04,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:04,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:04,757 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:04,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:04,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:04,758 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:04,761 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:04,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:04,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:04,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:04,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:04,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:04,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:04,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:04,794 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:04,806 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:04,806 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:37:04,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:04,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:04,809 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:04,811 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:04,837 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:04,848 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:04,848 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:04,849 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:04,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:37:04,855 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:04,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:04,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:04,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:04,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:04,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:04,904 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:04,928 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,008 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,013 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,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-10-12 17:37:05,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 123 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:05,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 123 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:05,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 123 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:05,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,021 INFO L430 stractBuchiCegarLoop]: Abstraction has has 22 places, 52 transitions, 256 flow [2023-10-12 17:37:05,021 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:05,021 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 52 transitions, 256 flow [2023-10-12 17:37:05,025 ERROR L47 etriNetUnfolderRabin]: [1:1A:[34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][12], 2:2A:[58] 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], 3:3A:[61] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2) (= v_N_3 v_sumThread1of1ForFork1_hi_6)) InVars {N=v_N_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{N=v_N_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, 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][8], 6:4A:[73] $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][40]][7:5A:[75] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_28 v_sumThread1of1ForFork1_hi_11) (= (+ v_sumThread1of1ForFork1_i_28 1) v_sumThread1of1ForFork1_i_27) (= (let ((.cse0 (+ (select v_A_11 v_sumThread1of1ForFork1_i_27) v_sumThread1of1ForFork1_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_19) (= (+ (select v_A_11 v_sumThread1of1ForFork1_i_28) v_sumThread1of1ForFork1_x_20) v_sumThread1of1ForFork1_x_19)) InVars {A=v_A_11, 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_11, 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][36]] [2023-10-12 17:37:05,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:05,026 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2023-10-12 17:37:05,027 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:37:05,029 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:05,030 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 39#[L54]true [58] 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] 41#[L54-1, $Ultimate##0]true [61] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2) (= v_N_3 v_sumThread1of1ForFork1_hi_6)) InVars {N=v_N_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{N=v_N_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, 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] 83#[$Ultimate##0, $Ultimate##0, L55]true [73] $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] 85#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:37:05,034 INFO L750 eck$LassoCheckResult]: Loop: 85#[L31-1, $Ultimate##0, L55]true [75] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_28 v_sumThread1of1ForFork1_hi_11) (= (+ v_sumThread1of1ForFork1_i_28 1) v_sumThread1of1ForFork1_i_27) (= (let ((.cse0 (+ (select v_A_11 v_sumThread1of1ForFork1_i_27) v_sumThread1of1ForFork1_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_19) (= (+ (select v_A_11 v_sumThread1of1ForFork1_i_28) v_sumThread1of1ForFork1_x_20) v_sumThread1of1ForFork1_x_19)) InVars {A=v_A_11, 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_11, 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] 85#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:37:05,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1994117, now seen corresponding path program 1 times [2023-10-12 17:37:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380518529] [2023-10-12 17:37:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:37:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,087 INFO L85 PathProgramCache]: Analyzing trace with hash 106, now seen corresponding path program 1 times [2023-10-12 17:37:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116491962] [2023-10-12 17:37:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash 61817702, now seen corresponding path program 1 times [2023-10-12 17:37:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320690745] [2023-10-12 17:37:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,250 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:05,250 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:05,250 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:05,250 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:05,250 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:05,250 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,250 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:05,250 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:05,250 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:05,251 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:05,251 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:05,253 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,255 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,258 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,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:05,262 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:05,307 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,310 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,312 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,469 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:05,469 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,470 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:05,484 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,486 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:05,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:05,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:05,492 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:05,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,513 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:05,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,514 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:05,517 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:05,519 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,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,533 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,533 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,552 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:05,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,554 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:05,557 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:05,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:37:05,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,589 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:05,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,590 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:05,592 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:05,597 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,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:05,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,628 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:05,636 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,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,644 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:05,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,660 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:05,660 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:05,665 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:05,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:05,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,690 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:05,694 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:05,694 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,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:05,738 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:05,738 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-10-12 17:37:05,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,739 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:05,742 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:05,743 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:05,767 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:05,767 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:05,767 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i, sumThread1of1ForFork1_hi) = -1*sumThread1of1ForFork1_i + 1*sumThread1of1ForFork1_hi Supporting invariants [] [2023-10-12 17:37:05,774 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:05,775 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:05,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:05,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:05,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:05,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:05,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:05,815 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,816 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,890 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,891 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:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2023-10-12 17:37:05,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 123 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 123 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 123 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,893 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 208 transitions, 1440 flow [2023-10-12 17:37:05,893 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:05,894 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 208 transitions, 1440 flow [2023-10-12 17:37:05,911 INFO L124 PetriNetUnfolderBase]: 25/49 cut-off events. [2023-10-12 17:37:05,912 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:37:05,912 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:05,921 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:05 BoogieIcfgContainer [2023-10-12 17:37:05,921 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:05,922 INFO L158 Benchmark]: Toolchain (without parser) took 2513.71ms. Allocated memory was 189.8MB in the beginning and 266.3MB in the end (delta: 76.5MB). Free memory was 142.9MB in the beginning and 176.7MB in the end (delta: -33.8MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2023-10-12 17:37:05,923 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 189.8MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:05,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.52ms. Allocated memory is still 189.8MB. Free memory was 142.7MB in the beginning and 141.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:05,924 INFO L158 Benchmark]: Boogie Preprocessor took 16.38ms. Allocated memory is still 189.8MB. Free memory was 141.3MB in the beginning and 140.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:05,926 INFO L158 Benchmark]: RCFGBuilder took 191.77ms. Allocated memory is still 189.8MB. Free memory was 140.2MB in the beginning and 131.2MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:05,929 INFO L158 Benchmark]: BuchiAutomizer took 2276.47ms. Allocated memory was 189.8MB in the beginning and 266.3MB in the end (delta: 76.5MB). Free memory was 131.0MB in the beginning and 176.7MB in the end (delta: -45.7MB). Peak memory consumption was 33.2MB. Max. memory is 8.0GB. [2023-10-12 17:37:05,935 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.22ms. Allocated memory is still 189.8MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.52ms. Allocated memory is still 189.8MB. Free memory was 142.7MB in the beginning and 141.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.38ms. Allocated memory is still 189.8MB. Free memory was 141.3MB in the beginning and 140.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 191.77ms. Allocated memory is still 189.8MB. Free memory was 140.2MB in the beginning and 131.2MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2276.47ms. Allocated memory was 189.8MB in the beginning and 266.3MB in the end (delta: 76.5MB). Free memory was 131.0MB in the beginning and 176.7MB in the end (delta: -45.7MB). Peak memory consumption was 33.2MB. 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 2 terminating modules (0 trivial, 2 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 127 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 94 mSDtfsCounter, 127 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital75 mio100 ax100 hnf100 lsp121 ukn62 mio100 lsp58 div100 bol100 ite100 ukn100 eq172 hnf94 smp100 dnf203 smp56 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms 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.4s - 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.3s, 31 PlacesBefore, 18 PlacesAfterwards, 26 TransitionsBefore, 13 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, independent: 150, independent conditional: 0, independent unconditional: 150, 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: 120, independent: 120, independent conditional: 0, independent unconditional: 120, 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: 120, independent: 120, independent conditional: 0, independent unconditional: 120, 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: 150, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 120, unknown conditional: 0, unknown unconditional: 120] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, 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:05,955 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:06,155 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...