/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:31,478 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:31,517 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:12:31,532 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:31,532 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:31,532 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:31,533 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:31,533 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:31,534 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:31,534 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:31,534 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:31,534 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:31,535 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:31,535 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:31,535 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:31,535 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:31,536 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:31,536 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:31,536 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:31,536 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:31,537 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:31,537 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:31,537 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:31,538 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:31,538 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:31,538 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:31,538 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:31,538 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:31,539 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:31,539 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:31,539 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:31,539 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:31,540 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:31,541 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:31,541 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:12:31,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:31,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:31,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:31,762 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:31,763 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:31,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl [2023-10-12 17:12:31,765 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-sample-abs.bpl' [2023-10-12 17:12:31,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:31,789 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:31,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:31,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:31,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:31,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,811 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:31,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:31,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:31,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:31,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:31,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:31,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:31,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:31,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:31,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/1) ... [2023-10-12 17:12:31,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:31,856 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:12:31,875 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:12:31,895 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:12:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:12:31,896 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:12:31,896 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:31,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:31,900 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:12:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:12:31,900 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:12:31,900 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mapAbs given in one single declaration [2023-10-12 17:12:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure mapAbs [2023-10-12 17:12:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure mapAbs [2023-10-12 17:12:31,901 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:12:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:12:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:12:31,902 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:12:31,940 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:31,942 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:32,047 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:32,052 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:32,052 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:32,054 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:32 BoogieIcfgContainer [2023-10-12 17:12:32,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:32,055 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:32,055 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:32,058 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:32,059 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:32,059 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:31" (1/2) ... [2023-10-12 17:12:32,060 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@203a6b41 and model type min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:32, skipping insertion in model container [2023-10-12 17:12:32,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:32,060 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:32" (2/2) ... [2023-10-12 17:12:32,061 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-sample-abs.bpl [2023-10-12 17:12:32,138 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:12:32,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 41 transitions, 108 flow [2023-10-12 17:12:32,194 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2023-10-12 17:12:32,194 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:12:32,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:12:32,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 41 transitions, 108 flow [2023-10-12 17:12:32,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 84 flow [2023-10-12 17:12:32,204 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:32,218 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 84 flow [2023-10-12 17:12:32,220 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 84 flow [2023-10-12 17:12:32,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 84 flow [2023-10-12 17:12:32,230 INFO L124 PetriNetUnfolderBase]: 3/33 cut-off events. [2023-10-12 17:12:32,230 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:12:32,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 33 events. 3/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 85 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2023-10-12 17:12:32,232 INFO L119 LiptonReduction]: Number of co-enabled transitions 618 [2023-10-12 17:12:32,570 INFO L134 LiptonReduction]: Checked pairs total: 598 [2023-10-12 17:12:32,570 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-10-12 17:12:32,584 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:32,584 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:32,584 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:32,584 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:32,585 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:32,585 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:32,585 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:32,585 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:32,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:32,651 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 102 [2023-10-12 17:12:32,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:32,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:32,655 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:32,655 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:32,655 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:32,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 174 states, but on-demand construction may add more states [2023-10-12 17:12:32,666 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 102 [2023-10-12 17:12:32,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:32,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:32,666 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:12:32,666 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:32,670 INFO L748 eck$LassoCheckResult]: Stem: 50#[$Ultimate##0]don't care [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 53#[L77, $Ultimate##0]don't care [124] $Ultimate##0-->L32-1: Formula: (and (= v_array_min_23 (select v_A_27 0)) (= v_computeMinThread1of1ForFork0_i1_21 0)) InVars {A=v_A_27} OutVars{A=v_A_27, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_21, array_min=v_array_min_23} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 57#[L32-1, L77]don't care [2023-10-12 17:12:32,670 INFO L750 eck$LassoCheckResult]: Loop: 57#[L32-1, L77]don't care [126] L32-1-->L32-1: Formula: (and (< v_computeMinThread1of1ForFork0_i1_30 v_N_17) (= (let ((.cse0 (let ((.cse1 (select v_A_33 v_computeMinThread1of1ForFork0_i1_30))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_min_30 .cse0) v_array_min_30 .cse0)) v_array_min_29) (= v_computeMinThread1of1ForFork0_i1_29 (+ v_computeMinThread1of1ForFork0_i1_30 1))) InVars {A=v_A_33, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_30, array_min=v_array_min_30, N=v_N_17} OutVars{A=v_A_33, computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_29, array_min=v_array_min_29, N=v_N_17} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, array_min] 57#[L32-1, L77]don't care [2023-10-12 17:12:32,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash 4309, now seen corresponding path program 1 times [2023-10-12 17:12:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179463154] [2023-10-12 17:12:32,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:32,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,732 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:32,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash 157, now seen corresponding path program 1 times [2023-10-12 17:12:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413345565] [2023-10-12 17:12:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:32,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash 133705, now seen corresponding path program 1 times [2023-10-12 17:12:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110299215] [2023-10-12 17:12:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:32,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:32,990 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:32,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:32,991 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:32,991 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:32,991 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:32,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:32,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:32,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:32,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:12:32,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:32,991 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:33,005 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:12:33,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:12:33,251 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:33,254 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:33,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:33,265 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:12:33,266 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:12:33,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:33,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:33,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:33,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:33,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:33,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:33,280 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:12:33,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:33,313 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:12:33,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:33,315 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:12:33,361 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:12:33,362 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:12:33,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:33,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:33,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:33,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:33,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:33,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:33,393 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:33,407 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:12:33,407 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:33,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:33,410 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:12:33,411 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:12:33,418 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:33,431 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:33,431 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:33,431 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMinThread1of1ForFork0_i1, N) = -1*computeMinThread1of1ForFork0_i1 + 1*N Supporting invariants [] [2023-10-12 17:12:33,443 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:12:33,446 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:33,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:33,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:33,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:33,493 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:33,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:33,493 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:12:33,518 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:12:33,520 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 174 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:33,583 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 174 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 464 states and 1932 transitions. Complement of second has 4 states. [2023-10-12 17:12:33,585 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:12:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2023-10-12 17:12:33,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:12:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:33,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:12:33,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:33,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 464 states and 1932 transitions. [2023-10-12 17:12:33,608 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 81 [2023-10-12 17:12:33,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 464 states to 334 states and 1397 transitions. [2023-10-12 17:12:33,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 188 [2023-10-12 17:12:33,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2023-10-12 17:12:33,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 334 states and 1397 transitions. [2023-10-12 17:12:33,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:33,619 INFO L219 hiAutomatonCegarLoop]: Abstraction has 334 states and 1397 transitions. [2023-10-12 17:12:33,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states and 1397 transitions. [2023-10-12 17:12:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 263. [2023-10-12 17:12:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 263 states have (on average 4.380228136882129) internal successors, (1152), 262 states have internal predecessors, (1152), 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:12:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1152 transitions. [2023-10-12 17:12:33,655 INFO L241 hiAutomatonCegarLoop]: Abstraction has 263 states and 1152 transitions. [2023-10-12 17:12:33,655 INFO L430 stractBuchiCegarLoop]: Abstraction has 263 states and 1152 transitions. [2023-10-12 17:12:33,655 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:33,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 263 states and 1152 transitions. [2023-10-12 17:12:33,658 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 81 [2023-10-12 17:12:33,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:33,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:33,659 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:33,659 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:33,659 INFO L748 eck$LassoCheckResult]: Stem: 1140#[$Ultimate##0]don't care [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 1142#[L77, $Ultimate##0]don't care [107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 1298#[L78, $Ultimate##0, $Ultimate##0]don't care [116] $Ultimate##0-->L46-1: Formula: (and (= v_computeMaxThread1of1ForFork1_i2_15 0) (= (select v_A_9 0) v_array_max_10)) InVars {A=v_A_9} OutVars{A=v_A_9, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_15, array_max=v_array_max_10} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 1356#[L78, L46-1, $Ultimate##0]don't care [2023-10-12 17:12:33,660 INFO L750 eck$LassoCheckResult]: Loop: 1356#[L78, L46-1, $Ultimate##0]don't care [128] L46-1-->L46-1: Formula: (and (= v_array_max_36 (let ((.cse0 (let ((.cse1 (select v_A_49 v_computeMaxThread1of1ForFork1_i2_30))) (ite (< .cse1 0) (- .cse1) .cse1)))) (ite (< v_array_max_37 .cse0) .cse0 v_array_max_37))) (< v_computeMaxThread1of1ForFork1_i2_30 v_N_27) (= (+ v_computeMaxThread1of1ForFork1_i2_30 1) v_computeMaxThread1of1ForFork1_i2_29)) InVars {A=v_A_49, N=v_N_27, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_30, array_max=v_array_max_37} OutVars{A=v_A_49, N=v_N_27, computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_29, array_max=v_array_max_36} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, array_max] 1356#[L78, L46-1, $Ultimate##0]don't care [2023-10-12 17:12:33,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash 133168, now seen corresponding path program 1 times [2023-10-12 17:12:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:33,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239057519] [2023-10-12 17:12:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:33,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash 159, now seen corresponding path program 1 times [2023-10-12 17:12:33,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:33,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487374546] [2023-10-12 17:12:33,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:33,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:33,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash 4128336, now seen corresponding path program 1 times [2023-10-12 17:12:33,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:33,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970579039] [2023-10-12 17:12:33,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:33,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,687 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:33,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:33,810 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:33,811 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:33,811 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:33,811 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:33,811 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:33,811 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:33,811 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:33,811 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:33,811 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:12:33,811 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:33,811 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:33,814 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:12:33,816 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:33,910 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:12:33,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:12:33,915 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:12:34,075 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:34,075 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:34,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,076 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:12:34,078 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:12:34,122 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:12:34,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:34,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:34,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:34,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:34,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:34,146 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:12:34,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,147 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:12:34,149 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:12:34,153 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:12:34,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,159 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:12:34,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,181 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:12:34,181 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:12:34,218 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:34,231 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:12:34,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,232 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:12:34,234 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:12:34,236 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:12:34,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:34,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:34,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:34,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:34,258 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:12:34,258 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:34,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,390 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:12:34,392 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:12:34,399 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:34,405 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:34,405 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:34,405 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(computeMaxThread1of1ForFork1_i2, N) = -1*computeMaxThread1of1ForFork1_i2 + 1*N Supporting invariants [] [2023-10-12 17:12:34,409 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:12:34,409 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:34,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:34,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:34,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:34,463 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:34,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:34,464 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:12:34,464 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:12:34,464 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 263 states and 1152 transitions. cyclomatic complexity: 1007 Second 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:12:34,510 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 263 states and 1152 transitions. cyclomatic complexity: 1007. Second 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) Result 767 states and 3519 transitions. Complement of second has 4 states. [2023-10-12 17:12:34,511 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:12:34,512 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:12:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2023-10-12 17:12:34,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:34,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:34,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:34,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:34,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:12:34,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:34,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 767 states and 3519 transitions. [2023-10-12 17:12:34,526 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 45 [2023-10-12 17:12:34,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 767 states to 517 states and 2345 transitions. [2023-10-12 17:12:34,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 210 [2023-10-12 17:12:34,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 280 [2023-10-12 17:12:34,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 517 states and 2345 transitions. [2023-10-12 17:12:34,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:34,537 INFO L219 hiAutomatonCegarLoop]: Abstraction has 517 states and 2345 transitions. [2023-10-12 17:12:34,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states and 2345 transitions. [2023-10-12 17:12:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 400. [2023-10-12 17:12:34,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 400 states have (on average 4.68) internal successors, (1872), 399 states have internal predecessors, (1872), 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:12:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1872 transitions. [2023-10-12 17:12:34,569 INFO L241 hiAutomatonCegarLoop]: Abstraction has 400 states and 1872 transitions. [2023-10-12 17:12:34,569 INFO L430 stractBuchiCegarLoop]: Abstraction has 400 states and 1872 transitions. [2023-10-12 17:12:34,569 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:34,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 400 states and 1872 transitions. [2023-10-12 17:12:34,572 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 45 [2023-10-12 17:12:34,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:34,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:34,572 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:34,572 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:34,573 INFO L748 eck$LassoCheckResult]: Stem: 2463#[$Ultimate##0]don't care [104] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{computeMinThread1of1ForFork0_i1=v_computeMinThread1of1ForFork0_i1_14, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMinThread1of1ForFork0_i1, computeMinThread1of1ForFork0_thidvar0] 2465#[L77, $Ultimate##0]don't care [107] L77-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork1_thidvar0_2 2) (= v_computeMaxThread1of1ForFork1_thidvar1_2 2)) InVars {} OutVars{computeMaxThread1of1ForFork1_i2=v_computeMaxThread1of1ForFork1_i2_14, computeMaxThread1of1ForFork1_thidvar0=v_computeMaxThread1of1ForFork1_thidvar0_2, computeMaxThread1of1ForFork1_thidvar1=v_computeMaxThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[computeMaxThread1of1ForFork1_i2, computeMaxThread1of1ForFork1_thidvar0, computeMaxThread1of1ForFork1_thidvar1] 2669#[L78, $Ultimate##0, $Ultimate##0]don't care [110] L78-->$Ultimate##0: Formula: (and (= v_sampleThread1of1ForFork2_thidvar0_2 3) (= v_sampleThread1of1ForFork2_thidvar2_2 3) (= v_sampleThread1of1ForFork2_thidvar1_2 3)) InVars {} OutVars{sampleThread1of1ForFork2_diff=v_sampleThread1of1ForFork2_diff_4, sampleThread1of1ForFork2_min_l=v_sampleThread1of1ForFork2_min_l_6, sampleThread1of1ForFork2_thidvar0=v_sampleThread1of1ForFork2_thidvar0_2, sampleThread1of1ForFork2_thidvar2=v_sampleThread1of1ForFork2_thidvar2_2, sampleThread1of1ForFork2_max_l=v_sampleThread1of1ForFork2_max_l_6, sampleThread1of1ForFork2_thidvar1=v_sampleThread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[sampleThread1of1ForFork2_diff, sampleThread1of1ForFork2_min_l, sampleThread1of1ForFork2_thidvar0, sampleThread1of1ForFork2_thidvar2, sampleThread1of1ForFork2_max_l, sampleThread1of1ForFork2_thidvar1] 2583#[$Ultimate##0, L79, $Ultimate##0, $Ultimate##0]don't care [113] L79-->$Ultimate##0: Formula: (and (= v_mapAbsThread1of1ForFork3_thidvar2_2 4) (= v_mapAbsThread1of1ForFork3_thidvar1_2 4) (= v_mapAbsThread1of1ForFork3_thidvar0_2 4) (= v_mapAbsThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{mapAbsThread1of1ForFork3_thidvar3=v_mapAbsThread1of1ForFork3_thidvar3_2, mapAbsThread1of1ForFork3_thidvar2=v_mapAbsThread1of1ForFork3_thidvar2_2, mapAbsThread1of1ForFork3_thidvar1=v_mapAbsThread1of1ForFork3_thidvar1_2, mapAbsThread1of1ForFork3_thidvar0=v_mapAbsThread1of1ForFork3_thidvar0_2, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_14} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_thidvar3, mapAbsThread1of1ForFork3_thidvar2, mapAbsThread1of1ForFork3_thidvar1, mapAbsThread1of1ForFork3_thidvar0, mapAbsThread1of1ForFork3_j] 2585#[$Ultimate##0, L80, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [89] $Ultimate##0-->L58-1: Formula: (= v_mapAbsThread1of1ForFork3_j_1 0) InVars {} OutVars{mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_1} AuxVars[] AssignedVars[mapAbsThread1of1ForFork3_j] 2745#[$Ultimate##0, L58-1, L80, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:12:34,574 INFO L750 eck$LassoCheckResult]: Loop: 2745#[$Ultimate##0, L58-1, L80, $Ultimate##0, $Ultimate##0]don't care [127] L58-1-->L58-1: Formula: (and (= v_mapAbsThread1of1ForFork3_j_21 (+ v_mapAbsThread1of1ForFork3_j_22 1)) (= v_A_39 (store v_A_40 v_mapAbsThread1of1ForFork3_j_22 (let ((.cse0 (select v_A_40 v_mapAbsThread1of1ForFork3_j_22))) (ite (< .cse0 0) (- .cse0) .cse0)))) (< v_mapAbsThread1of1ForFork3_j_22 v_N_21)) InVars {A=v_A_40, N=v_N_21, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_22} OutVars{A=v_A_39, N=v_N_21, mapAbsThread1of1ForFork3_j=v_mapAbsThread1of1ForFork3_j_21} AuxVars[] AssignedVars[A, mapAbsThread1of1ForFork3_j] 2745#[$Ultimate##0, L58-1, L80, $Ultimate##0, $Ultimate##0]don't care [2023-10-12 17:12:34,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash 127972274, now seen corresponding path program 1 times [2023-10-12 17:12:34,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053159322] [2023-10-12 17:12:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:34,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:12:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:34,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash 158, now seen corresponding path program 1 times [2023-10-12 17:12:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:34,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708084873] [2023-10-12 17:12:34,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:34,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:34,626 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:12:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:34,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -327826675, now seen corresponding path program 1 times [2023-10-12 17:12:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715306505] [2023-10-12 17:12:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:34,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:34,704 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:34,704 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:34,704 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:34,704 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:34,704 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:34,704 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,704 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:34,704 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:34,705 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-sample-abs.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:12:34,705 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:34,705 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:34,706 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:12:34,708 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:12:34,710 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:12:34,719 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:12:34,721 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:12:34,727 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:12:34,728 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:12:34,730 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:12:34,732 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:12:34,733 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:12:34,735 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:12:34,736 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:12:34,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:12:34,739 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:12:34,741 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:12:34,743 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:12:34,814 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:34,814 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:34,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,816 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:12:34,819 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:12:34,822 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:12:34,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:34,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:34,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:34,845 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:34,850 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:12:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,865 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:12:34,868 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:12:34,870 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:12:34,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:34,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:34,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:34,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:34,897 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:12:34,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,900 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:12:34,907 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:12:34,907 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:12:34,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:34,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:34,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:34,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:34,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:34,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:34,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:34,940 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:12:34,940 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:12:34,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:34,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:34,941 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:12:34,943 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:12:34,945 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:34,953 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:34,954 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:34,954 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mapAbsThread1of1ForFork3_j, N) = -1*mapAbsThread1of1ForFork3_j + 1*N Supporting invariants [] [2023-10-12 17:12:34,956 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:12:34,957 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:34,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:34,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:34,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:34,997 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:34,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:34,998 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:12:34,998 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:12:34,998 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 400 states and 1872 transitions. cyclomatic complexity: 1604 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:35,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 400 states and 1872 transitions. cyclomatic complexity: 1604. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 861 states and 3828 transitions. Complement of second has 4 states. [2023-10-12 17:12:35,044 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:12:35,045 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:12:35,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2023-10-12 17:12:35,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:35,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:35,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:12:35,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:35,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:12:35,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:35,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 3828 transitions. [2023-10-12 17:12:35,054 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:35,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 0 states and 0 transitions. [2023-10-12 17:12:35,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:12:35,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:12:35,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:12:35,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:35,054 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:35,055 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:35,055 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:35,055 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:35,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:12:35,055 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:35,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:12:35,060 INFO L201 PluginConnector]: Adding new model min-max-sample-abs.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:35 BoogieIcfgContainer [2023-10-12 17:12:35,060 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:35,061 INFO L158 Benchmark]: Toolchain (without parser) took 3271.51ms. Allocated memory was 170.9MB in the beginning and 254.8MB in the end (delta: 83.9MB). Free memory was 125.7MB in the beginning and 174.3MB in the end (delta: -48.7MB). Peak memory consumption was 37.3MB. Max. memory is 8.0GB. [2023-10-12 17:12:35,061 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.58ms. Allocated memory is still 170.9MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:35,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.33ms. Allocated memory is still 170.9MB. Free memory was 125.5MB in the beginning and 123.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:12:35,064 INFO L158 Benchmark]: Boogie Preprocessor took 18.84ms. Allocated memory is still 170.9MB. Free memory was 123.9MB in the beginning and 122.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:35,065 INFO L158 Benchmark]: RCFGBuilder took 221.66ms. Allocated memory is still 170.9MB. Free memory was 122.7MB in the beginning and 113.0MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:35,066 INFO L158 Benchmark]: BuchiAutomizer took 3005.64ms. Allocated memory was 170.9MB in the beginning and 254.8MB in the end (delta: 83.9MB). Free memory was 112.8MB in the beginning and 174.3MB in the end (delta: -61.5MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2023-10-12 17:12:35,071 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.58ms. Allocated memory is still 170.9MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.33ms. Allocated memory is still 170.9MB. Free memory was 125.5MB in the beginning and 123.9MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.84ms. Allocated memory is still 170.9MB. Free memory was 123.9MB in the beginning and 122.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 221.66ms. Allocated memory is still 170.9MB. Free memory was 122.7MB in the beginning and 113.0MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3005.64ms. Allocated memory was 170.9MB in the beginning and 254.8MB in the end (delta: 83.9MB). Free memory was 112.8MB in the beginning and 174.3MB in the end (delta: -61.5MB). Peak memory consumption was 23.7MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i2 and consists of 3 locations. One deterministic module has affine ranking function N + -1 * j and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 188 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 15 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp394 ukn15 mio100 lsp88 div100 bol100 ite100 ukn100 eq167 hnf96 smp100 dnf314 smp52 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 72ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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, 43 PlacesBefore, 29 PlacesAfterwards, 33 TransitionsBefore, 19 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 598 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 474, independent: 461, independent conditional: 0, independent unconditional: 461, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 357, independent: 345, independent conditional: 0, independent unconditional: 345, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 357, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 474, independent: 116, independent conditional: 0, independent unconditional: 116, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 357, unknown conditional: 0, unknown unconditional: 357] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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:12:35,096 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:12:35,286 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...