/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/weaver-benchmarks/generated/popl20-more/min-fun-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:29:39,849 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:29:39,921 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:29:39,949 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:29:39,950 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:29:39,950 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:29:39,952 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:29:39,952 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:29:39,953 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:29:39,956 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:29:39,956 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:29:39,957 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:29:39,957 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:29:39,958 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:29:39,958 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:29:39,958 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:29:39,958 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:29:39,959 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:29:39,959 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:29:39,959 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:29:39,959 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:29:39,961 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:29:39,962 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:29:39,962 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:29:39,962 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:29:39,962 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:29:39,962 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:29:39,963 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:29:39,963 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:29:39,963 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:29:39,963 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:29:39,963 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:29:39,964 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:29:39,965 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:29:39,965 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:29:40,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:29:40,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:29:40,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:29:40,208 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:29:40,209 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:29:40,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-fun-alt.wvr.bpl [2023-10-12 17:29:40,210 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-fun-alt.wvr.bpl' [2023-10-12 17:29:40,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:29:40,241 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:29:40,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:29:40,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:29:40,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:29:40,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,268 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:29:40,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:29:40,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:29:40,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:29:40,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:29:40,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:29:40,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:29:40,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:29:40,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:29:40,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/1) ... [2023-10-12 17:29:40,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:40,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:40,330 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:29:40,344 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:29:40,372 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:29:40,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:29:40,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:29:40,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:29:40,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:29:40,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:29:40,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:29:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:29:40,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:29:40,374 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:29:40,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:29:40,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:29:40,375 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:29:40,425 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:29:40,427 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:29:40,551 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:29:40,566 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:29:40,566 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:29:40,568 INFO L201 PluginConnector]: Adding new model min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:29:40 BoogieIcfgContainer [2023-10-12 17:29:40,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:29:40,569 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:29:40,570 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:29:40,573 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:29:40,574 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:29:40,574 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:40" (1/2) ... [2023-10-12 17:29:40,577 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7046fa78 and model type min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:29:40, skipping insertion in model container [2023-10-12 17:29:40,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:29:40,577 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:29:40" (2/2) ... [2023-10-12 17:29:40,578 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-fun-alt.wvr.bpl [2023-10-12 17:29:40,667 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:29:40,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:29:40,764 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:29:40,764 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:29:40,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:29:40,773 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:29:40,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,782 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:29:40,810 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,812 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:40,818 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:29:40,818 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:29:40,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:29:40,819 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:29:41,091 INFO L134 LiptonReduction]: Checked pairs total: 106 [2023-10-12 17:29:41,091 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:29:41,103 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:29:41,103 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:29:41,103 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:29:41,103 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:29:41,103 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:29:41,103 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:29:41,103 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:29:41,104 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:29:41,109 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:29:41,112 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:41,112 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:29:41,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:29:41,114 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:41,116 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:29:41,116 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:29:41,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:41,117 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:29:41,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:29:41,118 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:41,122 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [2023-10-12 17:29:41,122 INFO L750 eck$LassoCheckResult]: Loop: 44#[L22-1, L58-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_min1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< .cse0 v_min1_16) .cse0 v_min1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, min1=v_min1_16, N=v_N_12, i=v_i_16} OutVars{A=v_A_14, min1=v_min1_15, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[min1, i] 44#[L22-1, L58-1]true [2023-10-12 17:29:41,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:29:41,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:41,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522110244] [2023-10-12 17:29:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:41,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:41,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:29:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425771435] [2023-10-12 17:29:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:41,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash 130423, now seen corresponding path program 1 times [2023-10-12 17:29:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:41,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782871127] [2023-10-12 17:29:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:41,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:41,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:41,422 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:41,423 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:41,423 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:41,423 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:41,423 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:41,423 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,423 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:41,423 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:41,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-fun-alt.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:29:41,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:41,424 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:41,439 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:29:41,486 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:29:41,489 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:29:41,492 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:29:41,600 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:41,603 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:41,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:41,617 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:29:41,622 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:29:41,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:41,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:41,632 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:29:41,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:41,644 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:29:41,651 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:29:41,651 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:29:41,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:41,685 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:29:41,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:41,691 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:29:41,692 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:29:41,693 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:29:41,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:41,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:41,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:41,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:41,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:41,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:41,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:41,736 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:29:41,736 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:29:41,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:41,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:41,739 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:29:41,740 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:29:41,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:41,790 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:41,790 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:41,791 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:29:41,795 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:29:41,797 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:29:41,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:41,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:41,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:41,857 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:29:41,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:41,858 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:29:41,897 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:29:41,899 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:29:42,016 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 256 transitions. [2023-10-12 17:29:42,017 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:42,021 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:29:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:29:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:29:42,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:29:42,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:42,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:29:42,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:42,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:29:42,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:42,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:42,092 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:29:42,092 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:29:42,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 554 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:29:42,094 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:42,100 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:42,101 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:42,101 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:29:42,101 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:42,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:42,111 INFO L124 PetriNetUnfolderBase]: 29/44 cut-off events. [2023-10-12 17:29:42,113 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:29:42,113 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:42,126 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [2023-10-12 17:29:42,126 INFO L750 eck$LassoCheckResult]: Loop: 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= v_min2_25 (let ((.cse0 (select v_A_12 v_j_16))) (ite (< .cse0 v_min2_26) .cse0 v_min2_26))) (< v_j_16 v_M_10)) InVars {min2=v_min2_26, A=v_A_12, M=v_M_10, j=v_j_16} OutVars{min2=v_min2_25, A=v_A_12, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[min2, j] 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= v_min2_25 (let ((.cse0 (select v_A_12 v_j_16))) (ite (< .cse0 v_min2_26) .cse0 v_min2_26))) (< v_j_16 v_M_10)) InVars {min2=v_min2_26, A=v_A_12, M=v_M_10, j=v_j_16} OutVars{min2=v_min2_25, A=v_A_12, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[min2, j] 89#[L22-1, L59, L33-1]true [2023-10-12 17:29:42,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:29:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009907598] [2023-10-12 17:29:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:42,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 1 times [2023-10-12 17:29:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:42,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678718826] [2023-10-12 17:29:42,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:42,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:42,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash 125325192, now seen corresponding path program 1 times [2023-10-12 17:29:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:42,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611044890] [2023-10-12 17:29:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:42,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:42,397 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:29:42,428 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:42,429 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:42,429 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:42,429 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:42,429 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:42,429 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:42,429 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:42,429 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:42,429 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-fun-alt.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:29:42,429 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:42,429 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:42,433 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:29:42,436 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:29:42,438 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:29:42,542 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:29:42,545 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:29:42,549 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:29:42,755 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:42,755 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:42,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,757 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:29:42,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:29:42,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:42,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:42,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:42,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:42,774 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:42,774 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:42,772 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:29:42,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:42,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:42,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:42,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,798 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:29:42,807 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:29:42,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:42,816 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:29:42,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:42,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:42,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:42,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:42,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:42,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:42,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:42,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:42,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,845 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:29:42,856 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:29:42,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:42,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:42,865 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:29:42,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:42,879 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:29:42,892 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:29:42,892 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:29:42,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:42,951 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:29:42,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:42,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,952 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:29:42,959 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:29:42,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:42,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:42,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:42,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:42,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:42,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:42,979 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:29:42,979 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:42,989 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:29:42,989 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:29:42,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:42,990 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:29:42,992 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:29:42,994 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:43,002 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:43,002 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:43,003 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:29:43,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:29:43,014 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:29:43,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:43,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:43,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:43,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:29:43,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:43,061 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:29:43,062 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:29:43,207 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 7 states and 338 transitions. [2023-10-12 17:29:43,208 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:43,227 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:43,228 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:29:43,229 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:29:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:29:43,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:29:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:43,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:29:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:43,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:29:43,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:43,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:43,342 INFO L124 PetriNetUnfolderBase]: 383/568 cut-off events. [2023-10-12 17:29:43,342 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2023-10-12 17:29:43,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 568 events. 383/568 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2007 event pairs, 26 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 1278. Up to 202 conditions per place. [2023-10-12 17:29:43,344 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:43,380 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:43,380 INFO L430 stractBuchiCegarLoop]: Abstraction has has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:43,381 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:29:43,381 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 places, 2608 transitions, 19104 flow [2023-10-12 17:29:43,410 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:43,410 INFO L124 PetriNetUnfolderBase]: 151/213 cut-off events. [2023-10-12 17:29:43,410 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-10-12 17:29:43,410 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:43,411 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_min1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< .cse0 v_min1_16) .cse0 v_min1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, min1=v_min1_16, N=v_N_12, i=v_i_16} OutVars{A=v_A_14, min1=v_min1_15, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[min1, i] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 148#[L22-1, L60, L33-1, L44-1]true [98] L22-1-->thread1EXIT: Formula: (<= v_N_10 v_i_13) InVars {N=v_N_10, i=v_i_13} OutVars{N=v_N_10, i=v_i_13} AuxVars[] AssignedVars[] 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:29:43,411 INFO L750 eck$LassoCheckResult]: Loop: 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 150#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:29:43,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 178478329, now seen corresponding path program 1 times [2023-10-12 17:29:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:43,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514260132] [2023-10-12 17:29:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:43,444 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:29:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:43,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash 4001, now seen corresponding path program 1 times [2023-10-12 17:29:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:43,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211396206] [2023-10-12 17:29:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:43,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:43,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash -281014631, now seen corresponding path program 2 times [2023-10-12 17:29:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:43,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366874923] [2023-10-12 17:29:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:43,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:43,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:29:43,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366874923] [2023-10-12 17:29:43,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366874923] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:29:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083810587] [2023-10-12 17:29:43,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:29:43,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:29:43,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:43,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:29:43,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-10-12 17:29:43,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:29:43,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:29:43,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2023-10-12 17:29:43,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:43,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:29:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:43,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083810587] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:29:43,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:29:43,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-10-12 17:29:43,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650570321] [2023-10-12 17:29:43,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:29:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:29:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-10-12 17:29:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-10-12 17:29:43,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 2608 transitions, 19104 flow. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 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:29:43,851 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:29:43,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:29:44,614 INFO L124 PetriNetUnfolderBase]: 1809/2807 cut-off events. [2023-10-12 17:29:44,614 INFO L125 PetriNetUnfolderBase]: For 1010/1010 co-relation queries the response was YES. [2023-10-12 17:29:44,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 2807 events. 1809/2807 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14703 event pairs, 27 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 8551. Up to 989 conditions per place. [2023-10-12 17:29:44,635 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 645 selfloop transitions, 271 changer transitions 384/1300 dead transitions. [2023-10-12 17:29:44,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:44,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:44,920 INFO L124 PetriNetUnfolderBase]: 1809/2807 cut-off events. [2023-10-12 17:29:44,920 INFO L125 PetriNetUnfolderBase]: For 1010/1010 co-relation queries the response was YES. [2023-10-12 17:29:44,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 2807 events. 1809/2807 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 14689 event pairs, 27 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 8551. Up to 989 conditions per place. [2023-10-12 17:29:44,924 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:44,939 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-10-12 17:29:44,940 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:44,940 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:29:44,941 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 1300 transitions, 11573 flow [2023-10-12 17:29:44,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:44,981 INFO L124 PetriNetUnfolderBase]: 260/390 cut-off events. [2023-10-12 17:29:44,981 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-10-12 17:29:44,981 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:44,981 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_j_19) (= v_i_19 v_min1_19) (= v_i_19 v_min2_29)) InVars {min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} OutVars{min2=v_min2_29, min1=v_min1_19, N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_min1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< .cse0 v_min1_16) .cse0 v_min1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, min1=v_min1_16, N=v_N_12, i=v_i_16} OutVars{A=v_A_14, min1=v_min1_15, N=v_N_12, i=v_i_15} AuxVars[] AssignedVars[min1, i] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 148#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:44,981 INFO L750 eck$LassoCheckResult]: Loop: 148#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 148#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= v_min2_21 (let ((.cse0 (select v_A_10 v_k_16))) (ite (< .cse0 v_min2_22) .cse0 v_min2_22))) (< v_k_16 v_N_8)) InVars {min2=v_min2_22, A=v_A_10, N=v_N_8, k=v_k_16} OutVars{min2=v_min2_21, A=v_A_10, N=v_N_8, k=v_k_15} AuxVars[] AssignedVars[min2, k] 148#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:44,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash 125325244, now seen corresponding path program 1 times [2023-10-12 17:29:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006144439] [2023-10-12 17:29:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:44,988 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:44,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:44,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:44,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 4001, now seen corresponding path program 2 times [2023-10-12 17:29:44,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:44,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11504100] [2023-10-12 17:29:44,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:44,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:45,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:45,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash 178478236, now seen corresponding path program 1 times [2023-10-12 17:29:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29444105] [2023-10-12 17:29:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:45,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:45,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:45,224 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:45,225 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:45,225 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:45,225 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:45,225 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:45,225 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:45,225 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:45,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:45,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-fun-alt.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:29:45,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:45,225 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:45,228 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:29:45,352 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:29:45,359 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:29:45,363 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:29:45,366 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:29:45,368 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:29:45,371 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:29:45,373 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:29:45,375 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:29:45,602 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:45,603 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:45,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:45,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:45,604 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:29:45,616 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:29:45,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:45,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:45,625 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:29:45,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:45,647 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:29:45,648 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:29:45,648 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:29:45,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:45,692 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:29:45,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:45,694 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:29:45,703 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:29:45,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:45,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:45,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:45,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:45,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:45,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:45,720 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:29:45,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:45,741 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:29:45,741 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:29:45,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:45,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:45,746 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) [2023-10-12 17:29:45,747 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 [2023-10-12 17:29:45,749 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:45,766 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:45,766 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:45,766 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:29:45,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:45,777 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:29:45,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:45,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:45,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:45,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:29:45,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:45,817 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:29:45,818 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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) [2023-10-12 17:29:45,925 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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 7 states and 338 transitions. [2023-10-12 17:29:45,925 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:45,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:46,071 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:46,071 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:29:46,072 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) [2023-10-12 17:29:46,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:29:46,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:29:46,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:46,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:29:46,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:46,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:29:46,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:46,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:52,212 INFO L124 PetriNetUnfolderBase]: 4062/6244 cut-off events. [2023-10-12 17:29:52,212 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-10-12 17:29:52,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32787 conditions, 6244 events. 4062/6244 cut-off events. For 2163/2163 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 37270 event pairs, 4 based on Foata normal form. 0/3699 useless extension candidates. Maximal degree in co-relation 23231. Up to 2296 conditions per place. [2023-10-12 17:29:52,222 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:52,576 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:52,576 INFO L430 stractBuchiCegarLoop]: Abstraction has has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:52,576 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:29:52,576 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 places, 20054 transitions, 219308 flow [2023-10-12 17:29:59,794 INFO L124 PetriNetUnfolderBase]: 4062/6244 cut-off events. [2023-10-12 17:29:59,794 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-10-12 17:29:59,794 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:29:59,799 INFO L201 PluginConnector]: Adding new model min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:29:59 BoogieIcfgContainer [2023-10-12 17:29:59,799 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:29:59,800 INFO L158 Benchmark]: Toolchain (without parser) took 19558.42ms. Allocated memory was 179.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 127.1MB in the beginning and 666.2MB in the end (delta: -539.0MB). Peak memory consumption was 723.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:59,800 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 179.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:29:59,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.93ms. Allocated memory is still 179.3MB. Free memory was 127.1MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:59,801 INFO L158 Benchmark]: Boogie Preprocessor took 24.93ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 124.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:29:59,801 INFO L158 Benchmark]: RCFGBuilder took 271.18ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 114.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:29:59,802 INFO L158 Benchmark]: BuchiAutomizer took 19229.66ms. Allocated memory was 179.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 114.2MB in the beginning and 666.2MB in the end (delta: -551.9MB). Peak memory consumption was 710.4MB. Max. memory is 8.0GB. [2023-10-12 17:29:59,803 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.27ms. Allocated memory is still 179.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.93ms. Allocated memory is still 179.3MB. Free memory was 127.1MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.93ms. Allocated memory is still 179.3MB. Free memory was 125.7MB in the beginning and 124.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.18ms. Allocated memory is still 179.3MB. Free memory was 124.4MB in the beginning and 114.4MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 19229.66ms. Allocated memory was 179.3MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 114.2MB in the beginning and 666.2MB in the end (delta: -551.9MB). Peak memory consumption was 710.4MB. 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.4s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 499 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 146 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital104 mio100 ax100 hnf100 lsp314 ukn30 mio100 lsp58 div100 bol100 ite100 ukn100 eq157 hnf97 smp100 dnf329 smp41 tf100 neg100 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 99ms VariablesStem: 1 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:29:59,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:00,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...