/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:19:18,774 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:19:18,847 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:19:18,874 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:19:18,875 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:19:18,875 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:19:18,877 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:19:18,877 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:19:18,877 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:19:18,880 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:19:18,881 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:19:18,881 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:19:18,881 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:19:18,882 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:19:18,883 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:19:18,883 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:19:18,883 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:19:18,883 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:19:18,883 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:19:18,884 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:19:18,884 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:19:18,885 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:19:18,885 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:19:18,885 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:19:18,885 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:19:18,886 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:19:18,886 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:19:18,886 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:19:18,886 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:19:18,886 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:19:18,887 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:19:18,887 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:19:18,888 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:19:18,889 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:19:18,889 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:19:19,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:19:19,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:19:19,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:19:19,115 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:19:19,116 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:19:19,117 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 [2023-10-12 17:19:19,117 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min2-max2-sample.bpl' [2023-10-12 17:19:19,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:19:19,147 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:19:19,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:19,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:19:19,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:19:19,157 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 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,162 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 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,167 INFO L138 Inliner]: procedures = 4, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:19:19,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:19:19,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:19:19,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:19:19,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:19:19,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,181 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:19:19,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:19:19,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:19:19,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:19:19,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/1) ... [2023-10-12 17:19:19,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:19,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:19,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:19,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:19:19,271 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax given in one single declaration [2023-10-12 17:19:19,271 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax [2023-10-12 17:19:19,274 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax [2023-10-12 17:19:19,275 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:19:19,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:19:19,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:19:19,276 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:19:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:19:19,276 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:19:19,276 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin given in one single declaration [2023-10-12 17:19:19,276 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin [2023-10-12 17:19:19,276 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin [2023-10-12 17:19:19,277 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:19:19,316 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:19:19,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:19:19,411 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:19:19,423 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:19:19,423 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:19:19,425 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:19 BoogieIcfgContainer [2023-10-12 17:19:19,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:19:19,426 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:19:19,426 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:19:19,429 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:19:19,430 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:19,430 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:19:19" (1/2) ... [2023-10-12 17:19:19,431 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@165d47a2 and model type min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:19:19, skipping insertion in model container [2023-10-12 17:19:19,431 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:19:19,431 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:19:19" (2/2) ... [2023-10-12 17:19:19,433 INFO L332 chiAutomizerObserver]: Analyzing ICFG min2-max2-sample.bpl [2023-10-12 17:19:19,494 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:19:19,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 135 flow [2023-10-12 17:19:19,577 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2023-10-12 17:19:19,577 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:19:19,581 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. [2023-10-12 17:19:19,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 49 transitions, 135 flow [2023-10-12 17:19:19,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 105 flow [2023-10-12 17:19:19,587 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:19:19,598 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 105 flow [2023-10-12 17:19:19,600 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 105 flow [2023-10-12 17:19:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 105 flow [2023-10-12 17:19:19,608 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2023-10-12 17:19:19,608 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:19:19,609 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. [2023-10-12 17:19:19,610 INFO L119 LiptonReduction]: Number of co-enabled transitions 810 [2023-10-12 17:19:19,714 INFO L134 LiptonReduction]: Checked pairs total: 1274 [2023-10-12 17:19:19,715 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-10-12 17:19:19,729 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:19:19,730 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:19:19,730 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:19:19,730 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:19:19,730 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:19:19,730 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:19:19,730 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:19:19,730 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:19:19,731 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 34 transitions, 95 flow [2023-10-12 17:19:19,735 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:19,735 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-10-12 17:19:19,735 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:19,736 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:19,740 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:19:19,741 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 34 transitions, 95 flow [2023-10-12 17:19:19,747 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:19,747 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-10-12 17:19:19,747 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:19:19,747 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:19,754 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 [2023-10-12 17:19:19,755 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 [2023-10-12 17:19:19,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 126658, now seen corresponding path program 1 times [2023-10-12 17:19:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:19,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825583791] [2023-10-12 17:19:19,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:19,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:19,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:19,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:19,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2023-10-12 17:19:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:19,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481504000] [2023-10-12 17:19:19,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:19,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:19,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:19,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:19,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash 121721124, now seen corresponding path program 1 times [2023-10-12 17:19:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:19,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644051410] [2023-10-12 17:19:19,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:19,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:19,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:20,001 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:20,001 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:20,001 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:20,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:20,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:20,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:20,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:20,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:20,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:19:20,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:20,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:20,016 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:20,026 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:20,032 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:20,154 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:20,157 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:20,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:20,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:20,172 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:20,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:20,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:19:20,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:20,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:20,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:20,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:20,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:20,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:20,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:20,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:20,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:20,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:20,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:20,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:19:20,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:20,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:20,221 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:20,221 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:20,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:20,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:20,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:20,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:20,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:20,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:20,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:20,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:20,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:19:20,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:20,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:20,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:20,255 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:19:20,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:20,265 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:19:20,265 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:19:20,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:20,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:20,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:20,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:20,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:19:20,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:20,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:20,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:20,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:20,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:20,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:20,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:20,330 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:20,352 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:19:20,352 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:19:20,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:20,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:20,358 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:20,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:19:20,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:20,395 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:20,395 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:20,396 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i1) = 1*N - 1*i1 Supporting invariants [] [2023-10-12 17:19:20,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:19:20,411 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:19:20,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:20,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:20,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:20,456 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:19:20,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:19:20,493 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 [2023-10-12 17:19:20,494 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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) [2023-10-12 17:19:20,693 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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 8 states and 474 transitions. [2023-10-12 17:19:20,695 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:20,700 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:20,707 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 [2023-10-12 17:19:20,712 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) [2023-10-12 17:19:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2023-10-12 17:19:20,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:19:20,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:20,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:19:20,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:20,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:19:20,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:20,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 592 transitions, 2854 flow [2023-10-12 17:19:20,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:19:23,990 INFO L124 PetriNetUnfolderBase]: 55502/68736 cut-off events. [2023-10-12 17:19:23,990 INFO L125 PetriNetUnfolderBase]: For 7125/7125 co-relation queries the response was YES. [2023-10-12 17:19:24,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146958 conditions, 68736 events. 55502/68736 cut-off events. For 7125/7125 co-relation queries the response was YES. Maximal size of possible extension queue 2025. Compared 323005 event pairs, 2845 based on Foata normal form. 0/47914 useless extension candidates. Maximal degree in co-relation 118258. Up to 12222 conditions per place. [2023-10-12 17:19:24,123 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 61 places, 592 transitions, 2854 flow [2023-10-12 17:19:24,134 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 61 places, 592 transitions, 2854 flow [2023-10-12 17:19:24,134 INFO L430 stractBuchiCegarLoop]: Abstraction has has 61 places, 592 transitions, 2854 flow [2023-10-12 17:19:24,134 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:19:24,134 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 places, 592 transitions, 2854 flow [2023-10-12 17:19:24,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:24,144 INFO L124 PetriNetUnfolderBase]: 35/63 cut-off events. [2023-10-12 17:19:24,144 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-10-12 17:19:24,144 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:24,145 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] 127#[$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] 129#[$Ultimate##0, L33, L70]true [91] L33-->L36-1: Formula: (= v_i1_7 0) InVars {} OutVars{i1=v_i1_7} AuxVars[] AssignedVars[i1] 131#[$Ultimate##0, L36-1, L70]true [2023-10-12 17:19:24,145 INFO L750 eck$LassoCheckResult]: Loop: 131#[$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[] 134#[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] 131#[$Ultimate##0, L36-1, L70]true [2023-10-12 17:19:24,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash 3942981, now seen corresponding path program 1 times [2023-10-12 17:19:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:24,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491138481] [2023-10-12 17:19:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:24,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:24,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:24,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2023-10-12 17:19:24,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:24,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998802802] [2023-10-12 17:19:24,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:24,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:24,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:24,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:24,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -505759577, now seen corresponding path program 1 times [2023-10-12 17:19:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285144399] [2023-10-12 17:19:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:24,199 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:24,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:24,405 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:24,405 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:24,405 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:24,405 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:24,405 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:24,405 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:24,406 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:24,406 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:24,406 INFO L133 ssoRankerPreferences]: Filename of dumped script: min2-max2-sample.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:19:24,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:24,406 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:24,407 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:24,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:24,412 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:24,415 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:24,417 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:24,447 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:19:24,535 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:24,536 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:24,537 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:24,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:19:24,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:24,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:24,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:24,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:24,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:24,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:24,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:24,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:24,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:24,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:24,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:24,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:24,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:19:24,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:24,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:24,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:24,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:24,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:24,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:24,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:24,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:24,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:24,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:24,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:24,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:24,607 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:24,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:19:24,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:24,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:24,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:24,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:24,617 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:24,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:24,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:24,633 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:24,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:24,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:24,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:24,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:24,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:19:24,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:24,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:24,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:24,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:24,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:24,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:24,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:24,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:24,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:24,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:24,685 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:24,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:19:24,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:24,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:24,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:24,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:24,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:24,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:19:24,711 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:24,714 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:19:24,714 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:19:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:24,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:24,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:19:24,735 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:24,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:19:24,753 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:24,754 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:24,754 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i1) = 1*N - 1*i1 Supporting invariants [] [2023-10-12 17:19:24,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:24,771 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:19:24,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:24,784 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:24,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:24,798 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:19:24,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:19:24,819 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 [2023-10-12 17:19:24,819 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:19:24,933 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 474 transitions. [2023-10-12 17:19:24,933 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:24,975 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:24,975 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 [2023-10-12 17:19:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:19:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2023-10-12 17:19:24,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:24,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:24,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:24,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 10384 transitions, 71052 flow [2023-10-12 17:19:25,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:19:38,611 INFO L124 PetriNetUnfolderBase]: 116524/143173 cut-off events. [2023-10-12 17:19:38,611 INFO L125 PetriNetUnfolderBase]: For 15691/15691 co-relation queries the response was YES. [2023-10-12 17:19:38,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449310 conditions, 143173 events. 116524/143173 cut-off events. For 15691/15691 co-relation queries the response was YES. Maximal size of possible extension queue 4032. Compared 710318 event pairs, 2075 based on Foata normal form. 0/94832 useless extension candidates. Maximal degree in co-relation 365717. Up to 39390 conditions per place. [2023-10-12 17:19:38,815 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 77 places, 10384 transitions, 71052 flow [2023-10-12 17:19:38,898 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 77 places, 10384 transitions, 71052 flow [2023-10-12 17:19:38,898 INFO L430 stractBuchiCegarLoop]: Abstraction has has 77 places, 10384 transitions, 71052 flow [2023-10-12 17:19:38,898 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:19:38,898 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 places, 10384 transitions, 71052 flow [2023-10-12 17:19:38,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:38,946 INFO L124 PetriNetUnfolderBase]: 124/193 cut-off events. [2023-10-12 17:19:38,946 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-10-12 17:19:38,946 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:38,946 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] 127#[$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] 190#[$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] 192#[$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] 194#[$Ultimate##0, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0, L60]true [2023-10-12 17:19:38,947 INFO L750 eck$LassoCheckResult]: Loop: 194#[$Ultimate##0, $Ultimate##0, L73, $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] 197#[L62, $Ultimate##0, $Ultimate##0, L73, $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] 194#[$Ultimate##0, $Ultimate##0, L73, $Ultimate##0, $Ultimate##0, L60]true [2023-10-12 17:19:38,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash 122246471, now seen corresponding path program 1 times [2023-10-12 17:19:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:38,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883711741] [2023-10-12 17:19:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:38,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:38,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:38,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:38,977 INFO L85 PathProgramCache]: Analyzing trace with hash 3586, now seen corresponding path program 1 times [2023-10-12 17:19:38,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:38,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54389059] [2023-10-12 17:19:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:38,985 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:38,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:38,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:38,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1514744264, now seen corresponding path program 1 times [2023-10-12 17:19:38,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:38,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315334813] [2023-10-12 17:19:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:38,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:39,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:39,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:39,139 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:39,166 INFO L201 PluginConnector]: Adding new model min2-max2-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:19:39 BoogieIcfgContainer [2023-10-12 17:19:39,166 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:19:39,167 INFO L158 Benchmark]: Toolchain (without parser) took 20019.92ms. Allocated memory was 177.2MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 131.4MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-10-12 17:19:39,167 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 177.2MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:39,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.83ms. Allocated memory is still 177.2MB. Free memory was 131.3MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:39,168 INFO L158 Benchmark]: Boogie Preprocessor took 18.26ms. Allocated memory is still 177.2MB. Free memory was 129.7MB in the beginning and 128.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:39,168 INFO L158 Benchmark]: RCFGBuilder took 236.64ms. Allocated memory is still 177.2MB. Free memory was 128.6MB in the beginning and 118.8MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:19:39,168 INFO L158 Benchmark]: BuchiAutomizer took 19740.68ms. Allocated memory was 177.2MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 118.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-10-12 17:19:39,173 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.26ms. Allocated memory is still 177.2MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.83ms. Allocated memory is still 177.2MB. Free memory was 131.3MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.26ms. Allocated memory is still 177.2MB. Free memory was 129.7MB in the beginning and 128.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 236.64ms. Allocated memory is still 177.2MB. Free memory was 128.6MB in the beginning and 118.8MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 19740.68ms. Allocated memory was 177.2MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 118.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. 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 71052 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.6s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 294 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 180 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital43 mio100 ax100 hnf100 lsp130 ukn53 mio100 lsp60 div100 bol100 ite100 ukn100 eq166 hnf100 smp100 dnf160 smp58 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s - 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(); 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(); Loop: [L61] min_samples[i1 - 1] := array_min; [L62] max_samples[i2 - 1] := array_max; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 34 TransitionsAfterwards, 810 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 562, independent: 518, independent conditional: 0, independent unconditional: 518, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 386, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 386, independent: 360, independent conditional: 0, independent unconditional: 360, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 562, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 386, unknown conditional: 0, unknown unconditional: 386] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:19:39,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...