/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl


--------------------------------------------------------------------------------


This is Ultimate 0.2.3-?-9ecb849-m
[2024-02-09 23:53:49,210 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-09 23:53:49,369 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf
[2024-02-09 23:53:49,372 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-09 23:53:49,372 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-09 23:53:49,373 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks
[2024-02-09 23:53:49,397 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-09 23:53:49,398 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-09 23:53:49,398 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-09 23:53:49,399 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-09 23:53:49,399 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-09 23:53:49,399 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-09 23:53:49,400 INFO  L151        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-02-09 23:53:49,400 INFO  L153        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2024-02-09 23:53:49,400 INFO  L153        SettingsManager]:  * Use old map elimination=false
[2024-02-09 23:53:49,400 INFO  L153        SettingsManager]:  * Use external solver (rank synthesis)=false
[2024-02-09 23:53:49,401 INFO  L153        SettingsManager]:  * Use only trivial implications for array writes=true
[2024-02-09 23:53:49,401 INFO  L153        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2024-02-09 23:53:49,401 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-09 23:53:49,401 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2024-02-09 23:53:49,401 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-09 23:53:49,402 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-09 23:53:49,402 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-09 23:53:49,402 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-09 23:53:49,402 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2024-02-09 23:53:49,403 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-02-09 23:53:49,403 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2024-02-09 23:53:49,403 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-09 23:53:49,403 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-09 23:53:49,403 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-09 23:53:49,403 INFO  L153        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2024-02-09 23:53:49,404 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-09 23:53:49,404 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-09 23:53:49,404 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-09 23:53:49,404 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-09 23:53:49,405 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-09 23:53:49,405 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-09 23:53:49,405 INFO  L151        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-02-09 23:53:49,405 INFO  L153        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_PETRI_NET
[2024-02-09 23:53:49,598 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-09 23:53:49,614 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-09 23:53:49,616 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-09 23:53:49,617 INFO  L270        PluginConnector]: Initializing Boogie PL CUP Parser...
[2024-02-09 23:53:49,618 INFO  L274        PluginConnector]: Boogie PL CUP Parser initialized
[2024-02-09 23:53:49,619 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl
[2024-02-09 23:53:49,620 INFO  L110           BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl'
[2024-02-09 23:53:49,642 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-09 23:53:49,643 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2024-02-09 23:53:49,649 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-09 23:53:49,649 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-09 23:53:49,649 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-09 23:53:49,668 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,675 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,685 INFO  L138                Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0
[2024-02-09 23:53:49,687 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-09 23:53:49,688 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-09 23:53:49,688 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-09 23:53:49,688 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-09 23:53:49,707 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,707 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,708 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,708 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,710 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,713 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,714 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,714 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,715 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-09 23:53:49,716 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-09 23:53:49,716 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-09 23:53:49,716 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-09 23:53:49,717 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/1) ...
[2024-02-09 23:53:49,751 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:49,758 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:49,786 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)
[2024-02-09 23:53:49,800 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
[2024-02-09 23:53:49,848 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration
[2024-02-09 23:53:49,849 INFO  L130     BoogieDeclarations]: Found specification of procedure computeMax
[2024-02-09 23:53:49,849 INFO  L138     BoogieDeclarations]: Found implementation of procedure computeMax
[2024-02-09 23:53:49,849 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration
[2024-02-09 23:53:49,849 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-09 23:53:49,849 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-09 23:53:49,849 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration
[2024-02-09 23:53:49,850 INFO  L130     BoogieDeclarations]: Found specification of procedure sample
[2024-02-09 23:53:49,850 INFO  L138     BoogieDeclarations]: Found implementation of procedure sample
[2024-02-09 23:53:49,850 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration
[2024-02-09 23:53:49,850 INFO  L130     BoogieDeclarations]: Found specification of procedure computeMin
[2024-02-09 23:53:49,850 INFO  L138     BoogieDeclarations]: Found implementation of procedure computeMin
[2024-02-09 23:53:49,851 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-09 23:53:49,901 INFO  L236             CfgBuilder]: Building ICFG
[2024-02-09 23:53:49,903 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-09 23:53:50,029 INFO  L277             CfgBuilder]: Performing block encoding
[2024-02-09 23:53:50,047 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-09 23:53:50,047 INFO  L302             CfgBuilder]: Removed 1 assume(true) statements.
[2024-02-09 23:53:50,049 INFO  L201        PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:50 BoogieIcfgContainer
[2024-02-09 23:53:50,049 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-09 23:53:50,050 INFO  L112        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-02-09 23:53:50,050 INFO  L270        PluginConnector]: Initializing BuchiAutomizer...
[2024-02-09 23:53:50,075 INFO  L274        PluginConnector]: BuchiAutomizer initialized
[2024-02-09 23:53:50,075 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-02-09 23:53:50,076 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:49" (1/2) ...
[2024-02-09 23:53:50,077 INFO  L204        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1720e89b and model type min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:53:50, skipping insertion in model container
[2024-02-09 23:53:50,077 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-02-09 23:53:50,077 INFO  L184        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:50" (2/2) ...
[2024-02-09 23:53:50,078 INFO  L332   chiAutomizerObserver]: Analyzing ICFG min2-max2-sample.bpl
[2024-02-09 23:53:50,147 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2024-02-09 23:53:50,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 130 flow
[2024-02-09 23:53:50,196 INFO  L124   PetriNetUnfolderBase]: 5/39 cut-off events.
[2024-02-09 23:53:50,196 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-02-09 23:53:50,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59 conditions, 39 events. 5/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. 
[2024-02-09 23:53:50,201 INFO  L82        GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 130 flow
[2024-02-09 23:53:50,204 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 105 flow
[2024-02-09 23:53:50,209 INFO  L303   stractBuchiCegarLoop]: Interprodecural is true
[2024-02-09 23:53:50,209 INFO  L304   stractBuchiCegarLoop]: Hoare is false
[2024-02-09 23:53:50,209 INFO  L305   stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-02-09 23:53:50,209 INFO  L306   stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-02-09 23:53:50,209 INFO  L307   stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-02-09 23:53:50,209 INFO  L308   stractBuchiCegarLoop]: Difference is false
[2024-02-09 23:53:50,209 INFO  L309   stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-02-09 23:53:50,210 INFO  L313   stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ========
[2024-02-09 23:53:50,210 INFO  L84            BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 places, 39 transitions, 105 flow
[2024-02-09 23:53:50,215 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-09 23:53:50,215 INFO  L124   PetriNetUnfolderBase]: 0/11 cut-off events.
[2024-02-09 23:53:50,215 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-09 23:53:50,216 INFO  L88            BuchiIsEmpty]: Finished buchiIsEmpty language is not empty
[2024-02-09 23:53:50,218 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-02-09 23:53:50,218 INFO  L84            BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 places, 39 transitions, 105 flow
[2024-02-09 23:53:50,221 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-09 23:53:50,221 INFO  L124   PetriNetUnfolderBase]: 0/11 cut-off events.
[2024-02-09 23:53:50,221 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-09 23:53:50,221 INFO  L88            BuchiIsEmpty]: Finished buchiIsEmpty language is not empty
[2024-02-09 23:53:50,225 INFO  L748   eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]true [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] 61#[$Ultimate##0, L69]true [84] $Ultimate##0-->L33: Formula: (= v_array_min_6 0)  InVars {}  OutVars{array_min=v_array_min_6}  AuxVars[]  AssignedVars[array_min] 63#[L33, L69]true [85] L33-->L36-1: Formula: (= v_i1_7 0)  InVars {}  OutVars{i1=v_i1_7}  AuxVars[]  AssignedVars[i1] 65#[L36-1, L69]true 
[2024-02-09 23:53:50,225 INFO  L750   eck$LassoCheckResult]: Loop: 65#[L36-1, L69]true [87] L36-1-->L36: Formula: (< v_i1_2 v_N_3)  InVars {i1=v_i1_2, N=v_N_3}  OutVars{i1=v_i1_2, N=v_N_3}  AuxVars[]  AssignedVars[] 68#[L69, L36]true [89] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0))))  InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8}  OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7}  AuxVars[]  AssignedVars[array_min, i1] 65#[L36-1, L69]true 
[2024-02-09 23:53:50,229 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:50,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 126658, now seen corresponding path program 1 times
[2024-02-09 23:53:50,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:50,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242843094]
[2024-02-09 23:53:50,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:50,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:50,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:50,302 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:50,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:50,319 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:50,322 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:50,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times
[2024-02-09 23:53:50,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:50,322 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230913743]
[2024-02-09 23:53:50,322 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:50,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:50,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:50,336 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:50,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:50,343 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:50,345 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:50,345 INFO  L85        PathProgramCache]: Analyzing trace with hash 121721124, now seen corresponding path program 1 times
[2024-02-09 23:53:50,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:50,345 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353524502]
[2024-02-09 23:53:50,345 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:50,345 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:50,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:50,361 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:50,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:50,369 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:50,499 INFO  L210          LassoAnalysis]: Preferences:
[2024-02-09 23:53:50,499 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2024-02-09 23:53:50,499 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-02-09 23:53:50,499 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2024-02-09 23:53:50,499 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2024-02-09 23:53:50,500 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:50,500 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2024-02-09 23:53:50,500 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2024-02-09 23:53:50,500 INFO  L133   ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration1_Lasso
[2024-02-09 23:53:50,500 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-02-09 23:53:50,500 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2024-02-09 23:53:50,515 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:50,529 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:50,531 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:50,642 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2024-02-09 23:53:50,645 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2024-02-09 23:53:50,646 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:50,646 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:50,649 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)
[2024-02-09 23:53:50,681 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
[2024-02-09 23:53:50,689 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-09 23:53:50,689 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-09 23:53:50,689 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-09 23:53:50,689 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-09 23:53:50,693 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-02-09 23:53:50,693 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-02-09 23:53:50,698 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
[2024-02-09 23:53:50,707 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-02-09 23:53:50,713 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
[2024-02-09 23:53:50,713 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:50,714 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:50,714 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)
[2024-02-09 23:53:50,733 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
[2024-02-09 23:53:50,740 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-09 23:53:50,740 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-02-09 23:53:50,741 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-09 23:53:50,741 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-09 23:53:50,741 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-09 23:53:50,742 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-02-09 23:53:50,742 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-02-09 23:53:50,744 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
[2024-02-09 23:53:50,753 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-02-09 23:53:50,758 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
[2024-02-09 23:53:50,759 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:50,759 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:50,760 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)
[2024-02-09 23:53:50,765 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
[2024-02-09 23:53:50,766 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
[2024-02-09 23:53:50,774 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-09 23:53:50,774 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-09 23:53:50,774 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-09 23:53:50,774 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-09 23:53:50,783 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-02-09 23:53:50,784 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-02-09 23:53:50,799 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-02-09 23:53:50,805 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2024-02-09 23:53:50,805 INFO  L444   ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero.
[2024-02-09 23:53:50,807 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:50,807 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:50,809 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-02-09 23:53:50,828 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
[2024-02-09 23:53:50,829 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-02-09 23:53:50,845 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-02-09 23:53:50,846 INFO  L513          LassoAnalysis]: Proved termination.
[2024-02-09 23:53:50,847 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(i1, N) = -1*i1 + 1*N
Supporting invariants []
[2024-02-09 23:53:50,858 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
[2024-02-09 23:53:50,861 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-02-09 23:53:50,880 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:50,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-09 23:53:50,890 INFO  L262         TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-09 23:53:50,891 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-09 23:53:50,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-09 23:53:50,903 WARN  L260         TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-09 23:53:50,904 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-09 23:53:50,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-09 23:53:50,943 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2024-02-09 23:53:50,946 INFO  L162     BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-09 23:53:51,153 INFO  L171     BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 617 transitions.6 powerset states3 rank states. The highest rank that occured is 1
[2024-02-09 23:53:51,154 INFO  L89          BuchiIntersect]: Starting Intersection
[2024-02-09 23:53:51,154 INFO  L72    uchiIntersectDefault]: Starting Basic Intersection
[2024-02-09 23:53:51,169 INFO  L85    uchiIntersectDefault]: Exiting Basic Intersection
[2024-02-09 23:53:51,169 INFO  L99          BuchiIntersect]: Exiting Intersection
[2024-02-09 23:53:51,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2024-02-09 23:53:51,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-09 23:53:51,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions.
[2024-02-09 23:53:51,184 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 3 letters. Loop has 2 letters.
[2024-02-09 23:53:51,185 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-09 23:53:51,185 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 5 letters. Loop has 2 letters.
[2024-02-09 23:53:51,185 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-09 23:53:51,185 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 3 letters. Loop has 4 letters.
[2024-02-09 23:53:51,186 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-09 23:53:51,186 INFO  L428   stractBuchiCegarLoop]: Abstraction has has 68 places, 974 transitions, 4598 flow
[2024-02-09 23:53:51,187 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-02-09 23:53:51,189 INFO  L84            BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 places, 974 transitions, 4598 flow
[2024-02-09 23:53:51,249 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-09 23:53:51,250 INFO  L124   PetriNetUnfolderBase]: 146/208 cut-off events.
[2024-02-09 23:53:51,250 INFO  L125   PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES.
[2024-02-09 23:53:51,250 INFO  L88            BuchiIsEmpty]: Finished buchiIsEmpty language is not empty
[2024-02-09 23:53:51,250 INFO  L748   eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]true [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] 61#[$Ultimate##0, L69]true [101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2))  InVars {}  OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2}  AuxVars[]  AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1] 129#[$Ultimate##0, $Ultimate##0, L70]true [90] $Ultimate##0-->L33: Formula: (= v_array_min_6 0)  InVars {}  OutVars{array_min=v_array_min_6}  AuxVars[]  AssignedVars[array_min] 131#[$Ultimate##0, L33, L70]true [91] L33-->L36-1: Formula: (= v_i1_7 0)  InVars {}  OutVars{i1=v_i1_7}  AuxVars[]  AssignedVars[i1] 133#[$Ultimate##0, L36-1, L70]true [93] L36-1-->L36: Formula: (< v_i1_2 v_N_3)  InVars {i1=v_i1_2, N=v_N_3}  OutVars{i1=v_i1_2, N=v_N_3}  AuxVars[]  AssignedVars[] 135#[L36, $Ultimate##0, L70]true [95] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0))))  InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8}  OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7}  AuxVars[]  AssignedVars[array_min, i1] 133#[$Ultimate##0, L36-1, L70]true 
[2024-02-09 23:53:51,251 INFO  L750   eck$LassoCheckResult]: Loop: 133#[$Ultimate##0, L36-1, L70]true [93] L36-1-->L36: Formula: (< v_i1_2 v_N_3)  InVars {i1=v_i1_2, N=v_N_3}  OutVars{i1=v_i1_2, N=v_N_3}  AuxVars[]  AssignedVars[] 135#[L36, $Ultimate##0, L70]true [95] L36-->L36-1: Formula: (and (= (+ v_i1_9 1) v_i1_8) (= v_array_min_7 (let ((.cse0 (select v_A_5 v_i1_9))) (ite (< v_array_min_8 .cse0) v_array_min_8 .cse0))))  InVars {A=v_A_5, i1=v_i1_9, array_min=v_array_min_8}  OutVars{A=v_A_5, i1=v_i1_8, array_min=v_array_min_7}  AuxVars[]  AssignedVars[array_min, i1] 133#[$Ultimate##0, L36-1, L70]true 
[2024-02-09 23:53:51,251 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:51,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -505759577, now seen corresponding path program 1 times
[2024-02-09 23:53:51,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:51,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017954757]
[2024-02-09 23:53:51,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:51,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:51,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:51,265 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:51,277 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:51,283 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:51,284 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:51,284 INFO  L85        PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times
[2024-02-09 23:53:51,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:51,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521467734]
[2024-02-09 23:53:51,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:51,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:51,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:51,295 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:51,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:51,305 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:51,306 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:51,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -703646071, now seen corresponding path program 2 times
[2024-02-09 23:53:51,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:51,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763106842]
[2024-02-09 23:53:51,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:51,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:51,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:51,323 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:51,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:51,345 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:51,465 INFO  L210          LassoAnalysis]: Preferences:
[2024-02-09 23:53:51,465 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2024-02-09 23:53:51,466 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-02-09 23:53:51,466 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2024-02-09 23:53:51,466 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2024-02-09 23:53:51,466 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:51,466 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2024-02-09 23:53:51,466 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2024-02-09 23:53:51,466 INFO  L133   ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration2_Lasso
[2024-02-09 23:53:51,466 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2024-02-09 23:53:51,466 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2024-02-09 23:53:51,468 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:51,519 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:51,523 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:51,525 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:51,527 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:51,529 INFO  L118          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-02-09 23:53:51,654 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2024-02-09 23:53:51,654 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2024-02-09 23:53:51,654 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:51,655 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:51,656 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)
[2024-02-09 23:53:51,658 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
[2024-02-09 23:53:51,661 INFO  L120   nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-02-09 23:53:51,669 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-09 23:53:51,669 INFO  L203   nArgumentSynthesizer]: 2 stem disjuncts
[2024-02-09 23:53:51,669 INFO  L204   nArgumentSynthesizer]: 2 loop disjuncts
[2024-02-09 23:53:51,669 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-09 23:53:51,682 INFO  L401   nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications.
[2024-02-09 23:53:51,682 INFO  L402   nArgumentSynthesizer]: A total of 4 supporting invariants were added.
[2024-02-09 23:53:51,702 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-02-09 23:53:51,708 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
[2024-02-09 23:53:51,708 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:51,708 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:51,709 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)
[2024-02-09 23:53:51,714 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
[2024-02-09 23:53:51,715 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
[2024-02-09 23:53:51,721 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2024-02-09 23:53:51,721 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2024-02-09 23:53:51,721 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2024-02-09 23:53:51,721 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2024-02-09 23:53:51,724 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2024-02-09 23:53:51,724 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2024-02-09 23:53:51,752 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-02-09 23:53:51,757 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-02-09 23:53:51,757 INFO  L444   ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero.
[2024-02-09 23:53:51,757 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-02-09 23:53:51,757 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-02-09 23:53:51,760 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)
[2024-02-09 23:53:51,790 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
[2024-02-09 23:53:51,792 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-02-09 23:53:51,805 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-02-09 23:53:51,811 INFO  L438   nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2.
[2024-02-09 23:53:51,811 INFO  L513          LassoAnalysis]: Proved termination.
[2024-02-09 23:53:51,811 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(i1, N) = -1*i1 + 1*N
Supporting invariants []
[2024-02-09 23:53:51,827 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0
[2024-02-09 23:53:51,829 INFO  L156   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-02-09 23:53:51,841 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:51,846 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-09 23:53:51,846 INFO  L262         TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core
[2024-02-09 23:53:51,846 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-09 23:53:51,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-09 23:53:51,854 WARN  L260         TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-09 23:53:51,854 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-09 23:53:51,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-09 23:53:51,867 INFO  L141   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates 
[2024-02-09 23:53:51,867 INFO  L162     BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-09 23:53:51,964 INFO  L171     BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand  has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 617 transitions.6 powerset states3 rank states. The highest rank that occured is 1
[2024-02-09 23:53:51,964 INFO  L89          BuchiIntersect]: Starting Intersection
[2024-02-09 23:53:51,965 INFO  L72    uchiIntersectDefault]: Starting Basic Intersection
[2024-02-09 23:53:52,074 INFO  L85    uchiIntersectDefault]: Exiting Basic Intersection
[2024-02-09 23:53:52,074 INFO  L99          BuchiIntersect]: Exiting Intersection
[2024-02-09 23:53:52,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states 
[2024-02-09 23:53:52,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-09 23:53:52,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions.
[2024-02-09 23:53:52,079 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 6 letters. Loop has 2 letters.
[2024-02-09 23:53:52,079 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-09 23:53:52,080 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 8 letters. Loop has 2 letters.
[2024-02-09 23:53:52,080 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-09 23:53:52,080 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 5 states and 239 transitions. Stem has 6 letters. Loop has 4 letters.
[2024-02-09 23:53:52,080 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2024-02-09 23:53:52,080 INFO  L428   stractBuchiCegarLoop]: Abstraction has has 86 places, 24604 transitions, 165876 flow
[2024-02-09 23:53:52,080 INFO  L335   stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-02-09 23:53:52,080 INFO  L84            BuchiIsEmpty]: Start buchiIsEmpty. Operand has 86 places, 24604 transitions, 165876 flow
[2024-02-09 23:53:52,373 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0
[2024-02-09 23:53:52,699 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-09 23:53:52,699 INFO  L124   PetriNetUnfolderBase]: 1614/1958 cut-off events.
[2024-02-09 23:53:52,699 INFO  L125   PetriNetUnfolderBase]: For 221/221 co-relation queries the response was YES.
[2024-02-09 23:53:52,699 INFO  L88            BuchiIsEmpty]: Finished buchiIsEmpty language is not empty
[2024-02-09 23:53:52,701 INFO  L748   eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]true [98] $Ultimate##0-->$Ultimate##0: Formula: (= v_computeMinThread1of1ForFork0_thidvar0_2 1)  InVars {}  OutVars{computeMinThread1of1ForFork0_x=v_computeMinThread1of1ForFork0_x_2, computeMinThread1of1ForFork0_thidvar0=v_computeMinThread1of1ForFork0_thidvar0_2}  AuxVars[]  AssignedVars[computeMinThread1of1ForFork0_x, computeMinThread1of1ForFork0_thidvar0] 61#[$Ultimate##0, L69]true [101] L69-->$Ultimate##0: Formula: (and (= v_computeMinThread1of1ForFork1_thidvar0_2 2) (= v_computeMinThread1of1ForFork1_thidvar1_2 2))  InVars {}  OutVars{computeMinThread1of1ForFork1_x=v_computeMinThread1of1ForFork1_x_2, computeMinThread1of1ForFork1_thidvar0=v_computeMinThread1of1ForFork1_thidvar0_2, computeMinThread1of1ForFork1_thidvar1=v_computeMinThread1of1ForFork1_thidvar1_2}  AuxVars[]  AssignedVars[computeMinThread1of1ForFork1_x, computeMinThread1of1ForFork1_thidvar0, computeMinThread1of1ForFork1_thidvar1] 129#[$Ultimate##0, $Ultimate##0, L70]true [104] L70-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork2_thidvar2_2 3) (= v_computeMaxThread1of1ForFork2_thidvar0_2 3) (= v_computeMaxThread1of1ForFork2_thidvar1_2 3))  InVars {}  OutVars{computeMaxThread1of1ForFork2_y=v_computeMaxThread1of1ForFork2_y_2, computeMaxThread1of1ForFork2_thidvar2=v_computeMaxThread1of1ForFork2_thidvar2_2, computeMaxThread1of1ForFork2_thidvar1=v_computeMaxThread1of1ForFork2_thidvar1_2, computeMaxThread1of1ForFork2_thidvar0=v_computeMaxThread1of1ForFork2_thidvar0_2}  AuxVars[]  AssignedVars[computeMaxThread1of1ForFork2_y, computeMaxThread1of1ForFork2_thidvar2, computeMaxThread1of1ForFork2_thidvar1, computeMaxThread1of1ForFork2_thidvar0] 202#[$Ultimate##0, L71, $Ultimate##0, $Ultimate##0]true [107] L71-->$Ultimate##0: Formula: (and (= v_computeMaxThread1of1ForFork3_thidvar0_2 4) (= v_computeMaxThread1of1ForFork3_thidvar3_2 4) (= v_computeMaxThread1of1ForFork3_thidvar2_2 4) (= v_computeMaxThread1of1ForFork3_thidvar1_2 4))  InVars {}  OutVars{computeMaxThread1of1ForFork3_thidvar3=v_computeMaxThread1of1ForFork3_thidvar3_2, computeMaxThread1of1ForFork3_y=v_computeMaxThread1of1ForFork3_y_2, computeMaxThread1of1ForFork3_thidvar1=v_computeMaxThread1of1ForFork3_thidvar1_2, computeMaxThread1of1ForFork3_thidvar2=v_computeMaxThread1of1ForFork3_thidvar2_2, computeMaxThread1of1ForFork3_thidvar0=v_computeMaxThread1of1ForFork3_thidvar0_2}  AuxVars[]  AssignedVars[computeMaxThread1of1ForFork3_thidvar3, computeMaxThread1of1ForFork3_y, computeMaxThread1of1ForFork3_thidvar1, computeMaxThread1of1ForFork3_thidvar2, computeMaxThread1of1ForFork3_thidvar0] 204#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L72, $Ultimate##0]true [110] L72-->L60: Formula: (and (= 5 v_sampleThread1of1ForFork4_thidvar0_2) (= 5 v_sampleThread1of1ForFork4_thidvar1_2) (= 5 v_sampleThread1of1ForFork4_thidvar2_2) (= 5 v_sampleThread1of1ForFork4_thidvar4_2) (= 5 v_sampleThread1of1ForFork4_thidvar3_2))  InVars {}  OutVars{sampleThread1of1ForFork4_thidvar4=v_sampleThread1of1ForFork4_thidvar4_2, sampleThread1of1ForFork4_thidvar3=v_sampleThread1of1ForFork4_thidvar3_2, sampleThread1of1ForFork4_thidvar2=v_sampleThread1of1ForFork4_thidvar2_2, sampleThread1of1ForFork4_thidvar1=v_sampleThread1of1ForFork4_thidvar1_2, sampleThread1of1ForFork4_thidvar0=v_sampleThread1of1ForFork4_thidvar0_2}  AuxVars[]  AssignedVars[sampleThread1of1ForFork4_thidvar4, sampleThread1of1ForFork4_thidvar3, sampleThread1of1ForFork4_thidvar2, sampleThread1of1ForFork4_thidvar1, sampleThread1of1ForFork4_thidvar0] 206#[$Ultimate##0, L73, $Ultimate##0, $Ultimate##0, $Ultimate##0, L60]true [82] L60-->L62: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3))  InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3}  OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3}  AuxVars[]  AssignedVars[min_samples] 208#[L62, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [83] L62-->L60: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1)  InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2}  OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1}  AuxVars[]  AssignedVars[max_samples] 206#[$Ultimate##0, L73, $Ultimate##0, $Ultimate##0, $Ultimate##0, L60]true 
[2024-02-09 23:53:52,703 INFO  L750   eck$LassoCheckResult]: Loop: 206#[$Ultimate##0, L73, $Ultimate##0, $Ultimate##0, $Ultimate##0, L60]true [82] L60-->L62: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_1) v_array_min_3))  InVars {min_samples=v_min_samples_2, i1=v_i1_1, array_min=v_array_min_3}  OutVars{min_samples=v_min_samples_1, i1=v_i1_1, array_min=v_array_min_3}  AuxVars[]  AssignedVars[min_samples] 208#[L62, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [83] L62-->L60: Formula: (= (store v_max_samples_2 (+ (- 1) v_i2_7) v_array_max_6) v_max_samples_1)  InVars {i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_2}  OutVars{i2=v_i2_7, array_max=v_array_max_6, max_samples=v_max_samples_1}  AuxVars[]  AssignedVars[max_samples] 206#[$Ultimate##0, L73, $Ultimate##0, $Ultimate##0, $Ultimate##0, L60]true 
[2024-02-09 23:53:52,703 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:52,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 1514744264, now seen corresponding path program 1 times
[2024-02-09 23:53:52,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:52,703 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795120494]
[2024-02-09 23:53:52,703 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:52,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:52,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,715 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:52,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,728 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:52,728 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:52,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 3586, now seen corresponding path program 1 times
[2024-02-09 23:53:52,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:52,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936793766]
[2024-02-09 23:53:52,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:52,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:52,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,748 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:52,750 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,751 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:52,751 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-09 23:53:52,751 INFO  L85        PathProgramCache]: Analyzing trace with hash -324673015, now seen corresponding path program 2 times
[2024-02-09 23:53:52,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-09 23:53:52,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480086809]
[2024-02-09 23:53:52,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-09 23:53:52,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-09 23:53:52,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,763 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:52,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,768 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-09 23:53:52,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,939 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-09 23:53:52,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-09 23:53:52,965 INFO  L201        PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:53:52 BoogieIcfgContainer
[2024-02-09 23:53:52,965 INFO  L131        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-02-09 23:53:52,966 INFO  L158              Benchmark]: Toolchain (without parser) took 3322.85ms. Allocated memory was 195.0MB in the beginning and 491.8MB in the end (delta: 296.7MB). Free memory was 161.0MB in the beginning and 365.3MB in the end (delta: -204.3MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB.
[2024-02-09 23:53:52,966 INFO  L158              Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 195.0MB. Free memory was 162.2MB in the beginning and 162.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB.
[2024-02-09 23:53:52,967 INFO  L158              Benchmark]: Boogie Procedure Inliner took 37.99ms. Allocated memory is still 195.0MB. Free memory was 161.0MB in the beginning and 159.3MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2024-02-09 23:53:52,967 INFO  L158              Benchmark]: Boogie Preprocessor took 27.19ms. Allocated memory is still 195.0MB. Free memory was 159.3MB in the beginning and 169.9MB in the end (delta: -10.5MB). Peak memory consumption was 3.4MB. Max. memory is 8.0GB.
[2024-02-09 23:53:52,967 INFO  L158              Benchmark]: RCFGBuilder took 333.72ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 159.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
[2024-02-09 23:53:52,968 INFO  L158              Benchmark]: BuchiAutomizer took 2915.48ms. Allocated memory was 195.0MB in the beginning and 491.8MB in the end (delta: 296.7MB). Free memory was 159.4MB in the beginning and 365.3MB in the end (delta: -205.9MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB.
[2024-02-09 23:53:52,970 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.10ms. Allocated memory is still 195.0MB. Free memory was 162.2MB in the beginning and 162.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 37.99ms. Allocated memory is still 195.0MB. Free memory was 161.0MB in the beginning and 159.3MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 27.19ms. Allocated memory is still 195.0MB. Free memory was 159.3MB in the beginning and 169.9MB in the end (delta: -10.5MB). Peak memory consumption was 3.4MB. Max. memory is 8.0GB.
 * RCFGBuilder took 333.72ms. Allocated memory is still 195.0MB. Free memory was 169.9MB in the beginning and 159.5MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB.
 * BuchiAutomizer took 2915.48ms. Allocated memory was 195.0MB in the beginning and 491.8MB in the end (delta: 296.7MB). Free memory was 159.4MB in the beginning and 365.3MB in the end (delta: -205.9MB). Peak memory consumption was 92.1MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i1 and consists of 5 locations.  The remainder module has 165876 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 2.7s and 3 iterations.  TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1.	Nontrivial modules had stage [2, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 254 IncrementalHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 180 mSDtfsCounter, 254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks:   Lassos: inital57 mio100 ax100 hnf100 lsp142 ukn50 mio100 lsp62 div100 bol100 ite100 ukn100 eq154 hnf100 smp100 dnf170 smp54 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	InitialAbstractionConstructionTime: 0.0s
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - LassoShapedNonTerminationArgument [Line: 60]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite program execution.
Stem:
[L69]  FORK  0  fork 1 computeMin();
[L70]  FORK  0  fork 2, 2 computeMin();
[L71]  FORK  0  fork 3, 3, 3 computeMax();
[L72]  FORK  0  fork 4, 4, 4, 4 computeMax();
[L73]  FORK  0  fork 5, 5, 5, 5, 5 sample();
[L61]        5  min_samples[i1 - 1] := array_min;
       VAL      [array_min=9, i1=2990]
[L62]        5  max_samples[i2 - 1] := array_max;
       VAL      [array_max=6, array_min=9, i1=2990, i2=0]
Loop:
[L61]        min_samples[i1 - 1] := array_min;
[L62]        max_samples[i2 - 1] := array_max;
End of lasso representation.
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 60]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L69]  FORK  0  fork 1 computeMin();
[L70]  FORK  0  fork 2, 2 computeMin();
[L71]  FORK  0  fork 3, 3, 3 computeMax();
[L72]  FORK  0  fork 4, 4, 4, 4 computeMax();
[L73]  FORK  0  fork 5, 5, 5, 5, 5 sample();
[L61]        5  min_samples[i1 - 1] := array_min;
       VAL      [array_min=9, i1=2990]
[L62]        5  max_samples[i2 - 1] := array_max;
       VAL      [array_max=6, array_min=9, i1=2990, i2=0]
Loop:
[L61]        min_samples[i1 - 1] := array_min;
[L62]        max_samples[i2 - 1] := array_max;
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2024-02-09 23:53:52,991 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...