/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 --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:27:50,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:27:50,686 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-10 00:27:50,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:27:50,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:27:50,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:27:50,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:27:50,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:27:50,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:27:50,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:27:50,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:27:50,726 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:27:50,726 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:27:50,727 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:27:50,727 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:27:50,727 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:27:50,728 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:27:50,728 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:27:50,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:27:50,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:27:50,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:27:50,729 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:27:50,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:27:50,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:27:50,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:27:50,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:27:50,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:27:50,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:27:50,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:27:50,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:27:50,732 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:27:50,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:27:50,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:27:50,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:27:50,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:27:50,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:27:50,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:27:50,734 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:27:50,734 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:27:50,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:27:51,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:27:51,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:27:51,005 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:27:51,006 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:27:51,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl [2024-02-10 00:27:51,006 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2024-02-10 00:27:51,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:27:51,037 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:27:51,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:51,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:27:51,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:27:51,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,116 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:27:51,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:27:51,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:27:51,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:27:51,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:27:51,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:27:51,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:27:51,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:27:51,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:27:51,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/1) ... [2024-02-10 00:27:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:51,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:51,192 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-10 00:27:51,264 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-10 00:27:51,284 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2024-02-10 00:27:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2024-02-10 00:27:51,285 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2024-02-10 00:27:51,285 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:27:51,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:27:51,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:27:51,286 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2024-02-10 00:27:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2024-02-10 00:27:51,286 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2024-02-10 00:27:51,286 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2024-02-10 00:27:51,286 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2024-02-10 00:27:51,287 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2024-02-10 00:27:51,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2024-02-10 00:27:51,287 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2024-02-10 00:27:51,287 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2024-02-10 00:27:51,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2024-02-10 00:27:51,287 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2024-02-10 00:27:51,288 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2024-02-10 00:27:51,288 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:27:51,337 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:27:51,338 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:27:51,498 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:27:51,512 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:27:51,512 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-10 00:27:51,514 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:27:51 BoogieIcfgContainer [2024-02-10 00:27:51,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:27:51,515 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:27:51,515 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:27:51,526 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:27:51,527 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:51,527 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:27:51" (1/2) ... [2024-02-10 00:27:51,528 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bf774df and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:27:51, skipping insertion in model container [2024-02-10 00:27:51,529 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:27:51,529 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:27:51" (2/2) ... [2024-02-10 00:27:51,530 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2024-02-10 00:27:51,583 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-10 00:27:51,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 132 flow [2024-02-10 00:27:51,625 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2024-02-10 00:27:51,625 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-10 00:27:51,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 40 events. 5/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-02-10 00:27:51,630 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 132 flow [2024-02-10 00:27:51,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2024-02-10 00:27:51,648 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:27:51,648 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:27:51,648 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:27:51,648 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:27:51,649 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:27:51,649 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:27:51,649 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:27:51,649 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:27:51,649 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:51,650 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 51 places, 40 transitions, 107 flow [2024-02-10 00:27:51,916 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 4704 states, 4702 states have (on average 4.908336877924287) internal successors, (23079), 4703 states have internal predecessors, (23079), 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-10 00:27:51,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4704 states, 4702 states have (on average 4.908336877924287) internal successors, (23079), 4703 states have internal predecessors, (23079), 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-10 00:27:52,100 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 4456 [2024-02-10 00:27:52,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:52,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:52,105 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:27:52,105 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:52,105 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 51 places, 40 transitions, 107 flow [2024-02-10 00:27:52,332 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 4704 states, 4702 states have (on average 4.908336877924287) internal successors, (23079), 4703 states have internal predecessors, (23079), 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-10 00:27:52,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4704 states, 4702 states have (on average 4.908336877924287) internal successors, (23079), 4703 states have internal predecessors, (23079), 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-10 00:27:52,442 INFO L131 ngComponentsAnalysis]: Automaton has 784 accepting balls. 4456 [2024-02-10 00:27:52,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:52,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:52,454 INFO L748 eck$LassoCheckResult]: Stem: Black: 9469#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] 9472#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] 9474#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 9476#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 9478#[L100-1, $Ultimate##0]don't care [112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1] 9480#[L100-1, L36-1]don't care [2024-02-10 00:27:52,455 INFO L750 eck$LassoCheckResult]: Loop: 9480#[L100-1, L36-1]don't care [114] L36-1-->L36: Formula: (< v_i1_3 v_k_4) InVars {i1=v_i1_3, k=v_k_4} OutVars{i1=v_i1_3, k=v_k_4} AuxVars[] AssignedVars[] 9488#[L100-1, L36]don't care [116] L36-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_11 v_i1_9))) (ite (< v_array_min_15 .cse0) v_array_min_15 .cse0)) v_array_min_14) (= (+ v_i1_9 1) v_i1_8)) InVars {A=v_A_11, i1=v_i1_9, array_min=v_array_min_15} OutVars{A=v_A_11, i1=v_i1_8, array_min=v_array_min_14} AuxVars[] AssignedVars[array_min, i1] 9480#[L100-1, L36-1]don't care [2024-02-10 00:27:52,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash 127812647, now seen corresponding path program 1 times [2024-02-10 00:27:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817192033] [2024-02-10 00:27:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:52,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,550 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:52,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash 4611, now seen corresponding path program 1 times [2024-02-10 00:27:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270749018] [2024-02-10 00:27:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:52,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:52,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:52,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1726094167, now seen corresponding path program 1 times [2024-02-10 00:27:52,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:52,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056443013] [2024-02-10 00:27:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:52,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:52,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:52,838 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:52,839 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:52,839 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:52,839 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:52,839 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:52,839 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:52,839 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:52,840 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:52,840 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:27:52,840 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:52,840 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:52,854 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-10 00:27:52,967 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-10 00:27:53,066 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:53,069 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:53,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:53,073 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-10 00:27:53,078 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-10 00:27:53,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:53,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:53,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:53,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:53,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:53,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:53,098 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-10 00:27:53,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:53,113 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-02-10 00:27:53,113 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:27:53,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:53,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:53,117 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-10 00:27:53,120 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:53,127 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-10 00:27:53,144 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:53,145 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:53,145 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2024-02-10 00:27:53,152 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-10 00:27:53,154 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:53,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:53,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:53,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:53,230 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:53,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:53,247 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-10 00:27:53,306 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-10 00:27:53,307 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:27:53,441 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 639 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:27:53,442 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:53,442 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:53,443 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:27:53,470 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:27:53,470 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:53,479 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-10 00:27:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:27:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2024-02-10 00:27:53,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 5 letters. Loop has 2 letters. [2024-02-10 00:27:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:53,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-10 00:27:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:53,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 00:27:53,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:53,486 INFO L428 stractBuchiCegarLoop]: Abstraction has has 60 places, 509 transitions, 2387 flow [2024-02-10 00:27:53,486 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:27:53,486 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:53,486 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 60 places, 509 transitions, 2387 flow [2024-02-10 00:27:53,752 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-10 00:27:54,445 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 10186 states, 10180 states have (on average 7.406581532416503) internal successors, (75399), 10185 states have internal predecessors, (75399), 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-10 00:27:54,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10186 states, 10180 states have (on average 7.406581532416503) internal successors, (75399), 10185 states have internal predecessors, (75399), 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-10 00:27:54,697 INFO L131 ngComponentsAnalysis]: Automaton has 863 accepting balls. 4322 [2024-02-10 00:27:54,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:27:54,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:27:54,701 INFO L748 eck$LassoCheckResult]: Stem: Black: 18924#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] Black: 18929#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] 18932#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] 18937#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 18942#[L100-1, $Ultimate##0]don't care [143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1] 18947#[$Ultimate##0, L101, $Ultimate##0]don't care [107] $Ultimate##0-->L48-1: Formula: (= v_i2_1 (+ v_k_1 1)) InVars {k=v_k_1} OutVars{i2=v_i2_1, k=v_k_1} AuxVars[] AssignedVars[i2] 18957#[L48-1, $Ultimate##0, L101]don't care [2024-02-10 00:27:54,701 INFO L750 eck$LassoCheckResult]: Loop: 18957#[L48-1, $Ultimate##0, L101]don't care [109] L48-1-->L48: Formula: (< v_i2_2 v_N_1) InVars {i2=v_i2_2, N=v_N_1} OutVars{i2=v_i2_2, N=v_N_1} AuxVars[] AssignedVars[] 18991#[$Ultimate##0, L101, L48]don't care [111] L48-->L48-1: Formula: (and (= v_i2_8 (+ v_i2_9 1)) (= (let ((.cse0 (select v_A_7 v_i2_9))) (ite (< v_array_min_11 .cse0) v_array_min_11 .cse0)) v_array_min_10)) InVars {A=v_A_7, i2=v_i2_9, array_min=v_array_min_11} OutVars{A=v_A_7, i2=v_i2_8, array_min=v_array_min_10} AuxVars[] AssignedVars[array_min, i2] 18957#[L48-1, $Ultimate##0, L101]don't care [2024-02-10 00:27:54,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash -332774171, now seen corresponding path program 1 times [2024-02-10 00:27:54,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646171821] [2024-02-10 00:27:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:54,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:54,730 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2024-02-10 00:27:54,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414943778] [2024-02-10 00:27:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:54,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:54,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1968394937, now seen corresponding path program 1 times [2024-02-10 00:27:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:27:54,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462968280] [2024-02-10 00:27:54,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:27:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:27:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:27:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:27:54,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:27:54,882 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:27:54,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:27:54,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:27:54,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:27:54,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:27:54,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:54,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:27:54,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:27:54,883 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:27:54,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:27:54,883 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:27:54,886 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-10 00:27:54,889 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-10 00:27:54,891 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-10 00:27:54,937 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-10 00:27:55,032 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:27:55,032 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:27:55,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,093 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-10 00:27:55,135 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-10 00:27:55,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:55,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:55,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:55,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:55,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:55,151 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-10 00:27:55,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:55,166 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-10 00:27:55,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,168 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-10 00:27:55,173 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-10 00:27:55,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:55,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:55,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:55,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:55,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:55,189 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-10 00:27:55,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:27:55,203 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 [2024-02-10 00:27:55,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,220 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-10 00:27:55,244 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-10 00:27:55,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:27:55,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:27:55,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:27:55,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:27:55,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:27:55,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:27:55,271 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:27:55,290 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:27:55,298 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:27:55,298 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:27:55,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:27:55,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:27:55,313 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-10 00:27:55,340 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-10 00:27:55,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:27:55,368 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:27:55,369 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:27:55,369 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2024-02-10 00:27:55,376 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-10 00:27:55,377 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:27:55,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:27:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:55,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:27:55,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:27:55,436 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:27:55,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:27:55,461 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-10 00:27:55,462 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-10 00:27:55,463 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-10 00:27:55,613 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 639 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:27:55,614 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:27:55,614 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:27:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 639 transitions. [2024-02-10 00:27:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 639 transitions. [2024-02-10 00:27:55,631 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:27:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 639 transitions. [2024-02-10 00:27:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 639 transitions. [2024-02-10 00:27:55,767 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-10 00:27:56,008 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:27:56,008 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:27:56,009 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-10 00:27:56,009 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-10 00:27:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2024-02-10 00:27:56,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 6 letters. Loop has 2 letters. [2024-02-10 00:27:56,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 8 letters. Loop has 2 letters. [2024-02-10 00:27:56,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 00:27:56,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:27:56,011 INFO L428 stractBuchiCegarLoop]: Abstraction has has 73 places, 8445 transitions, 56637 flow [2024-02-10 00:27:56,011 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:27:56,011 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:27:56,011 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 73 places, 8445 transitions, 56637 flow [2024-02-10 00:28:14,230 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 26869 states, 26839 states have (on average 9.867021871157643) internal successors, (264821), 26868 states have internal predecessors, (264821), 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-10 00:28:14,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 26869 states, 26839 states have (on average 9.867021871157643) internal successors, (264821), 26868 states have internal predecessors, (264821), 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-10 00:28:14,932 INFO L131 ngComponentsAnalysis]: Automaton has 1844 accepting balls. 8168 [2024-02-10 00:28:14,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:14,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:14,936 INFO L748 eck$LassoCheckResult]: Stem: Black: 44833#[$Ultimate##0]don't care [105] $Ultimate##0-->L97: Formula: (and (<= 0 v_k_2) (<= v_k_2 v_N_3)) InVars {k=v_k_2, N=v_N_3} OutVars{k=v_k_2, N=v_N_3} AuxVars[] AssignedVars[] Black: 44836#[L97]don't care [72] L97-->L98: Formula: (= (select v_A_2 0) v_array_min_3) InVars {A=v_A_2} OutVars{A=v_A_2, array_min=v_array_min_3} AuxVars[] AssignedVars[array_min] Black: 44848#[L98]don't care [67] L98-->L100: Formula: (= v_array_max_1 (select v_A_3 0)) InVars {A=v_A_3} OutVars{A=v_A_3, array_max=v_array_max_1} AuxVars[] AssignedVars[array_max] Black: 44862#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] Black: 44879#[$Ultimate##0, L100-1]don't care [143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1] 44896#[$Ultimate##0, $Ultimate##0, L101]don't care [146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2] Black: 44913#[L102, $Ultimate##0, $Ultimate##0, $Ultimate##0]don't care [122] $Ultimate##0-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3] 44993#[L61-1, $Ultimate##0, L102, $Ultimate##0]don't care [2024-02-10 00:28:14,936 INFO L750 eck$LassoCheckResult]: Loop: 44993#[L61-1, $Ultimate##0, L102, $Ultimate##0]don't care [124] L61-1-->L61: Formula: (< v_i3_1 v_k_6) InVars {i3=v_i3_1, k=v_k_6} OutVars{i3=v_i3_1, k=v_k_6} AuxVars[] AssignedVars[] Black: 45125#[L102, $Ultimate##0, $Ultimate##0, L61]don't care [126] L61-->L61-1: Formula: (and (= v_i3_8 (+ v_i3_9 1)) (= (let ((.cse0 (select v_A_13 v_i3_9))) (ite (< v_array_max_15 .cse0) .cse0 v_array_max_15)) v_array_max_14)) InVars {A=v_A_13, array_max=v_array_max_15, i3=v_i3_9} OutVars{A=v_A_13, array_max=v_array_max_14, i3=v_i3_8} AuxVars[] AssignedVars[array_max, i3] 44993#[L61-1, $Ultimate##0, L102, $Ultimate##0]don't care [2024-02-10 00:28:14,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:14,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1726063378, now seen corresponding path program 1 times [2024-02-10 00:28:14,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:14,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736001182] [2024-02-10 00:28:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:14,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:14,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:14,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:14,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:14,955 INFO L85 PathProgramCache]: Analyzing trace with hash 4931, now seen corresponding path program 1 times [2024-02-10 00:28:14,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006638224] [2024-02-10 00:28:14,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:14,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:14,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:14,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:14,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -889526032, now seen corresponding path program 1 times [2024-02-10 00:28:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252025867] [2024-02-10 00:28:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:14,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:15,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:15,114 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:15,114 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:15,114 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:15,114 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:15,115 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:15,115 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:15,115 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:15,115 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:15,115 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration3_Lasso [2024-02-10 00:28:15,115 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:15,115 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:15,117 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-10 00:28:15,120 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-10 00:28:15,123 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-10 00:28:15,125 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-10 00:28:15,162 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-10 00:28:15,165 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-10 00:28:15,168 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-10 00:28:15,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:15,290 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:15,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:15,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:15,291 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-10 00:28:15,294 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-10 00:28:15,316 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-10 00:28:15,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:15,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:15,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:15,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:15,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:15,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:15,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:15,352 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-10 00:28:15,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:15,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:15,354 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) [2024-02-10 00:28:15,388 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-10 00:28:15,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:15,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:15,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:15,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:15,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:15,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:15,402 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 [2024-02-10 00:28:15,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:15,423 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 [2024-02-10 00:28:15,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:15,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:15,428 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) [2024-02-10 00:28:15,429 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 [2024-02-10 00:28:15,457 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-10 00:28:15,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:15,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:15,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:15,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:15,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:15,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:15,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:15,551 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 [2024-02-10 00:28:15,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:15,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:15,568 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) [2024-02-10 00:28:15,587 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-10 00:28:15,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:15,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:15,598 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 00:28:15,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:15,617 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 00:28:15,617 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 00:28:15,628 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 [2024-02-10 00:28:15,664 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:15,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-02-10 00:28:15,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:15,721 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) [2024-02-10 00:28:15,728 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 [2024-02-10 00:28:15,744 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-10 00:28:15,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:15,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:15,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:15,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:15,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:15,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:15,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:15,784 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 00:28:15,784 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-02-10 00:28:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:15,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:15,786 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:28:15,792 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:15,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:28:15,805 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:28:15,805 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:15,805 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, i3) = 1*k - 1*i3 Supporting invariants [] [2024-02-10 00:28:15,828 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 [2024-02-10 00:28:15,830 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:28:15,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:15,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:15,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:15,895 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:28:15,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:15,913 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-10 00:28:15,914 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-10 00:28:15,914 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:16,006 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 639 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:28:16,007 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:16,007 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 639 transitions. [2024-02-10 00:28:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 639 transitions. [2024-02-10 00:28:16,009 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:28:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 639 transitions. [2024-02-10 00:28:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 639 transitions. [2024-02-10 00:28:16,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-02-10 00:28:22,178 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:28:22,178 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:22,180 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-10 00:28:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2024-02-10 00:28:22,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 7 letters. Loop has 2 letters. [2024-02-10 00:28:22,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:22,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 9 letters. Loop has 2 letters. [2024-02-10 00:28:22,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:22,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 247 transitions. Stem has 7 letters. Loop has 4 letters. [2024-02-10 00:28:22,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:22,193 INFO L428 stractBuchiCegarLoop]: Abstraction has has 86 places, 140029 transitions, 1221671 flow [2024-02-10 00:28:22,193 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:28:22,193 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:22,193 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 86 places, 140029 transitions, 1221671 flow