/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:41:36,856 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:41:36,915 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:41:36,938 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:41:36,938 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:41:36,939 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:41:36,940 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:41:36,940 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:41:36,940 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:41:36,945 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:41:36,945 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:41:36,945 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:41:36,945 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:41:36,946 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:41:36,946 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:41:36,946 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:41:36,946 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:41:36,946 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:41:36,947 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:41:36,947 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:41:36,947 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:41:36,948 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:41:36,948 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:41:36,948 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:41:36,949 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:41:36,949 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:41:36,949 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:41:36,949 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:41:36,949 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:41:36,949 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:41:36,950 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:41:36,950 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:41:36,950 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:41:36,951 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:41:36,951 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 -> RABIN_PETRI_NET [2023-10-12 17:41:37,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:41:37,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:41:37,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:41:37,157 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:41:37,158 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:41:37,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl [2023-10-12 17:41:37,159 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl' [2023-10-12 17:41:37,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:41:37,188 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:41:37,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:37,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:41:37,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:41:37,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,208 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:41:37,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:41:37,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:41:37,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:41:37,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:41:37,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:41:37,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:41:37,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:41:37,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:41:37,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/1) ... [2023-10-12 17:41:37,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:37,257 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:41:37,298 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:41:37,309 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:41:37,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:41:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:41:37,310 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:41:37,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:41:37,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:41:37,310 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:41:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:41:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:41:37,314 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:41:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:41:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:41:37,314 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:41:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:41:37,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:41:37,315 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:41:37,352 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:41:37,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:41:37,443 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:41:37,455 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:41:37,455 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:41:37,457 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:37 BoogieIcfgContainer [2023-10-12 17:41:37,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:41:37,458 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:41:37,458 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:41:37,466 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:41:37,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:37,466 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:41:37" (1/2) ... [2023-10-12 17:41:37,467 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3775991f and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:41:37, skipping insertion in model container [2023-10-12 17:41:37,467 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:41:37,467 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:41:37" (2/2) ... [2023-10-12 17:41:37,469 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-dec.wvr.bpl [2023-10-12 17:41:37,548 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:41:37,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 110 flow [2023-10-12 17:41:37,581 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2023-10-12 17:41:37,582 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:41:37,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:41:37,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 110 flow [2023-10-12 17:41:37,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 86 flow [2023-10-12 17:41:37,590 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:41:37,599 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 86 flow [2023-10-12 17:41:37,600 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 86 flow [2023-10-12 17:41:37,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 86 flow [2023-10-12 17:41:37,607 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2023-10-12 17:41:37,607 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:41:37,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:41:37,609 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-10-12 17:41:37,853 INFO L134 LiptonReduction]: Checked pairs total: 394 [2023-10-12 17:41:37,853 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:41:37,862 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:41:37,862 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:41:37,862 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:41:37,862 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:41:37,862 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:41:37,862 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:41:37,862 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:41:37,862 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:41:37,863 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 22 transitions, 68 flow [2023-10-12 17:41:37,868 ERROR L47 etriNetUnfolderRabin]: [1:1A:[73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[][10], 2:2A:[99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 3:3A:[79] $Ultimate##0-->L25: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min][1], 5:4A:[80] L25-->L27-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1][8]][6:5A:[114] L27-1-->L27-1: Formula: (and (< v_i_14 v_N_9) (= v_i_13 (+ v_i_14 1)) (= (let ((.cse0 (select v_A_19 v_i_14))) (ite (< v_min_14 .cse0) v_min_14 .cse0)) v_min_13)) InVars {A=v_A_19, N=v_N_9, i=v_i_14, min=v_min_14} OutVars{A=v_A_19, N=v_N_9, i=v_i_13, min=v_min_13} AuxVars[] AssignedVars[i, min][19]] [2023-10-12 17:41:37,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:37,873 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:41:37,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:37,873 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:37,875 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:41:37,875 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 32 places, 22 transitions, 68 flow [2023-10-12 17:41:37,876 ERROR L47 etriNetUnfolderRabin]: [1:1A:[73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[][10], 2:2A:[99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6], 3:3A:[79] $Ultimate##0-->L25: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min][1], 5:4A:[80] L25-->L27-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1][8]][6:5A:[114] L27-1-->L27-1: Formula: (and (< v_i_14 v_N_9) (= v_i_13 (+ v_i_14 1)) (= (let ((.cse0 (select v_A_19 v_i_14))) (ite (< v_min_14 .cse0) v_min_14 .cse0)) v_min_13)) InVars {A=v_A_19, N=v_N_9, i=v_i_14, min=v_min_14} OutVars{A=v_A_19, N=v_N_9, i=v_i_13, min=v_min_13} AuxVars[] AssignedVars[i, min][19]] [2023-10-12 17:41:37,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:37,876 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-10-12 17:41:37,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:41:37,877 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:37,880 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[] 51#[L68]true [99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 53#[$Ultimate##0, L68-1]true [79] $Ultimate##0-->L25: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min] 55#[L68-1, L25]true [80] L25-->L27-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1] 57#[L27-1, L68-1]true [2023-10-12 17:41:37,880 INFO L750 eck$LassoCheckResult]: Loop: 57#[L27-1, L68-1]true [114] L27-1-->L27-1: Formula: (and (< v_i_14 v_N_9) (= v_i_13 (+ v_i_14 1)) (= (let ((.cse0 (select v_A_19 v_i_14))) (ite (< v_min_14 .cse0) v_min_14 .cse0)) v_min_13)) InVars {A=v_A_19, N=v_N_9, i=v_i_14, min=v_min_14} OutVars{A=v_A_19, N=v_N_9, i=v_i_13, min=v_min_13} AuxVars[] AssignedVars[i, min] 57#[L27-1, L68-1]true [2023-10-12 17:41:37,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 3195932, now seen corresponding path program 1 times [2023-10-12 17:41:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:37,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255556911] [2023-10-12 17:41:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:37,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:37,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:37,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash 145, now seen corresponding path program 1 times [2023-10-12 17:41:37,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:37,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431893213] [2023-10-12 17:41:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:37,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:38,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash 99074006, now seen corresponding path program 1 times [2023-10-12 17:41:38,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:38,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360726491] [2023-10-12 17:41:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:38,216 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:38,216 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:38,216 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:38,216 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:38,216 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:38,216 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,217 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:38,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:38,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-dec.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:41:38,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:38,217 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:38,230 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:41:38,239 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:41:38,241 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:41:38,244 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:41:38,246 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:41:38,249 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:41:38,251 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:41:38,253 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:41:38,382 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:38,385 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:38,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,388 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:41:38,389 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:41:38,391 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:41:38,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:38,425 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:41:38,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,426 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:41:38,429 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:41:38,430 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:41:38,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,460 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:38,473 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:41:38,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,474 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:41:38,477 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:41:38,478 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:41:38,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:38,513 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:41:38,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,514 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:41:38,516 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:41:38,518 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:41:38,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:38,539 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:41:38,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,541 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:41:38,545 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:41:38,548 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:41:38,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:38,576 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:41:38,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,578 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:41:38,581 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:41:38,582 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:41:38,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:38,616 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:41:38,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,617 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:41:38,619 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:41:38,621 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:41:38,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:38,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:38,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,650 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:41:38,650 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:41:38,652 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:41:38,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:38,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:38,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:38,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:38,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:38,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:38,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:38,705 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:38,706 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:38,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:38,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:38,718 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:41:38,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:41:38,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:38,785 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:38,785 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:38,785 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:41:38,790 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:41:38,793 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:38,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:38,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:38,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:38,841 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:38,841 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:38,841 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:41:38,872 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:41:38,936 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:41:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:41:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2023-10-12 17:41:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:41:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:41:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:38,943 INFO L430 stractBuchiCegarLoop]: Abstraction has has 36 places, 88 transitions, 448 flow [2023-10-12 17:41:38,943 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:41:38,943 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 36 places, 88 transitions, 448 flow [2023-10-12 17:41:38,946 ERROR L47 etriNetUnfolderRabin]: [1:1A:[73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[][40], 2:2A:[99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][24], 4:3A:[102] L68-1-->$Ultimate##0: 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][28], 9:4A:[105] L69-->L51-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][16]][10:5A:[118] L51-1-->L51-1: Formula: (and (= v_A_23 (store v_A_24 v_l_18 (+ (- 1) (select v_A_24 v_l_18)))) (= (+ v_l_18 1) v_l_17) (< v_l_18 v_N_13)) InVars {A=v_A_24, N=v_N_13, l=v_l_18} OutVars{A=v_A_23, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[A, l][64]] [2023-10-12 17:41:38,946 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:38,946 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2023-10-12 17:41:38,946 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:41:38,946 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:38,946 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[] 51#[L68]true [99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 53#[$Ultimate##0, L68-1]true [102] L68-1-->$Ultimate##0: 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] 100#[$Ultimate##0, $Ultimate##0, L69]true [105] L69-->L51-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] 102#[$Ultimate##0, $Ultimate##0, L51-1, L70]true [2023-10-12 17:41:38,947 INFO L750 eck$LassoCheckResult]: Loop: 102#[$Ultimate##0, $Ultimate##0, L51-1, L70]true [118] L51-1-->L51-1: Formula: (and (= v_A_23 (store v_A_24 v_l_18 (+ (- 1) (select v_A_24 v_l_18)))) (= (+ v_l_18 1) v_l_17) (< v_l_18 v_N_13)) InVars {A=v_A_24, N=v_N_13, l=v_l_18} OutVars{A=v_A_23, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[A, l] 102#[$Ultimate##0, $Ultimate##0, L51-1, L70]true [2023-10-12 17:41:38,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash 3196670, now seen corresponding path program 1 times [2023-10-12 17:41:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:38,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719042909] [2023-10-12 17:41:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:38,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:38,955 INFO L85 PathProgramCache]: Analyzing trace with hash 149, now seen corresponding path program 1 times [2023-10-12 17:41:38,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:38,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006663250] [2023-10-12 17:41:38,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:38,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash 99096888, now seen corresponding path program 1 times [2023-10-12 17:41:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:38,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707475311] [2023-10-12 17:41:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:38,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:38,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:39,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:41:39,090 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:39,090 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:39,090 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:39,090 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:39,090 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:39,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:39,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:39,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-dec.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:41:39,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:39,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:39,092 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:41:39,095 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:41:39,097 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:41:39,106 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:41:39,110 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:41:39,112 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:41:39,117 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:41:39,119 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:41:39,121 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:41:39,123 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:41:39,125 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:41:39,130 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:41:39,132 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:41:39,222 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:39,222 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:39,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,225 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:41:39,232 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:41:39,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,244 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:41:39,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,251 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:41:39,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,252 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:41:39,253 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:41:39,255 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:41:39,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,271 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,274 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:41:39,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,275 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:41:39,277 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:41:39,278 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:41:39,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:41:39,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:41:39,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:41:39,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,303 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:41:39,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,304 INFO L229 MonitoredProcess]: Starting monitored process 14 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:41:39,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:41:39,308 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:41:39,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,337 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:39,340 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:41:39,341 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:39,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,342 INFO L229 MonitoredProcess]: Starting monitored process 15 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:41:39,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:41:39,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:39,366 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:39,367 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:39,367 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(l, N) = -1*l + 1*N Supporting invariants [] [2023-10-12 17:41:39,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,370 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:39,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:39,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:39,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:39,396 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:39,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:39,397 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:41:39,397 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:41:39,453 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:41:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 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:41:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2023-10-12 17:41:39,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:41:39,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:39,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:39,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:39,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:41:39,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:39,455 INFO L430 stractBuchiCegarLoop]: Abstraction has has 40 places, 352 transitions, 2496 flow [2023-10-12 17:41:39,455 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:41:39,455 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 40 places, 352 transitions, 2496 flow [2023-10-12 17:41:39,462 ERROR L47 etriNetUnfolderRabin]: [1:1A:[73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[][162], 2:2A:[99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][98], 4:3A:[102] L68-1-->$Ultimate##0: 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][114], 11:4A:[85] $Ultimate##0-->L38: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max][146], 47:5A:[86] L38-->L40-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2][178]][48:6A:[120] L40-1-->L40-1: Formula: (and (< v_j_14 v_N_17) (= (+ v_j_14 1) v_j_13) (= v_max_15 (let ((.cse0 (select v_A_27 v_j_14))) (ite (< .cse0 v_max_16) v_max_16 .cse0)))) InVars {A=v_A_27, N=v_N_17, j=v_j_14, max=v_max_16} OutVars{A=v_A_27, N=v_N_17, j=v_j_13, max=v_max_15} AuxVars[] AssignedVars[j, max][210]] [2023-10-12 17:41:39,463 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:41:39,463 INFO L124 PetriNetUnfolderBase]: 28/47 cut-off events. [2023-10-12 17:41:39,463 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-10-12 17:41:39,463 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:41:39,463 INFO L748 eck$LassoCheckResult]: Stem: 49#[$Ultimate##0]true [73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[] 51#[L68]true [99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 53#[$Ultimate##0, L68-1]true [102] L68-1-->$Ultimate##0: 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] 100#[$Ultimate##0, $Ultimate##0, L69]true [85] $Ultimate##0-->L38: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max] 139#[$Ultimate##0, L38, L69]true [86] L38-->L40-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2] 141#[$Ultimate##0, L69, L40-1]true [2023-10-12 17:41:39,463 INFO L750 eck$LassoCheckResult]: Loop: 141#[$Ultimate##0, L69, L40-1]true [120] L40-1-->L40-1: Formula: (and (< v_j_14 v_N_17) (= (+ v_j_14 1) v_j_13) (= v_max_15 (let ((.cse0 (select v_A_27 v_j_14))) (ite (< .cse0 v_max_16) v_max_16 .cse0)))) InVars {A=v_A_27, N=v_N_17, j=v_j_14, max=v_max_16} OutVars{A=v_A_27, N=v_N_17, j=v_j_13, max=v_max_15} AuxVars[] AssignedVars[j, max] 141#[$Ultimate##0, L69, L40-1]true [2023-10-12 17:41:39,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:39,464 INFO L85 PathProgramCache]: Analyzing trace with hash 99096236, now seen corresponding path program 1 times [2023-10-12 17:41:39,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:39,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562213588] [2023-10-12 17:41:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:39,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:39,471 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2023-10-12 17:41:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587053422] [2023-10-12 17:41:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:39,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1222983860, now seen corresponding path program 1 times [2023-10-12 17:41:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:41:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745891759] [2023-10-12 17:41:39,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:41:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:41:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:41:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:41:39,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:41:39,597 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:41:39,597 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:41:39,597 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:41:39,597 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:41:39,597 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:41:39,597 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,597 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:41:39,597 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:41:39,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-dec.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:41:39,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:41:39,597 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:41:39,600 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:41:39,603 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:41:39,604 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:41:39,607 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:41:39,611 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:41:39,613 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:41:39,615 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:41:39,644 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:41:39,646 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:41:39,648 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:41:39,757 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:41:39,758 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:41:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,759 INFO L229 MonitoredProcess]: Starting monitored process 16 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:41:39,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:41:39,762 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:41:39,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,780 INFO L229 MonitoredProcess]: Starting monitored process 17 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:41:39,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:41:39,782 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:41:39,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,789 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,789 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,802 INFO L229 MonitoredProcess]: Starting monitored process 18 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:41:39,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:41:39,805 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:41:39,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,834 INFO L229 MonitoredProcess]: Starting monitored process 19 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:41:39,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:41:39,848 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:41:39,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,871 INFO L229 MonitoredProcess]: Starting monitored process 20 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:41:39,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:41:39,883 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:41:39,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,890 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,890 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,902 INFO L229 MonitoredProcess]: Starting monitored process 21 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:41:39,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:41:39,905 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:41:39,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,924 INFO L229 MonitoredProcess]: Starting monitored process 22 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:41:39,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:41:39,928 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:41:39,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,934 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:41:39,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,939 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:41:39,939 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:41:39,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:41:39,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:39,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,964 INFO L229 MonitoredProcess]: Starting monitored process 23 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:41:39,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:41:39,967 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:41:39,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:41:39,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:41:39,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:41:39,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:41:39,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:41:39,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:41:39,990 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:41:39,993 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:41:39,994 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:41:39,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:41:39,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:41:39,996 INFO L229 MonitoredProcess]: Starting monitored process 24 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:41:40,001 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:41:40,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:41:40,007 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:41:40,007 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:41:40,007 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2023-10-12 17:41:40,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:40,012 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:41:40,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:41:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:40,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:41:40,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:41:40,041 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:41:40,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:41:40,041 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:41:40,042 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:41:40,090 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:41:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:41:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2023-10-12 17:41:40,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:41:40,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:40,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:41:40,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:40,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:41:40,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:41:40,092 INFO L430 stractBuchiCegarLoop]: Abstraction has has 44 places, 1408 transitions, 12800 flow [2023-10-12 17:41:40,092 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:41:40,092 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 44 places, 1408 transitions, 12800 flow [2023-10-12 17:41:40,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:40,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:41:40,254 INFO L124 PetriNetUnfolderBase]: 736/990 cut-off events. [2023-10-12 17:41:40,254 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-10-12 17:41:40,254 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:41:40,259 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:41:40 BoogieIcfgContainer [2023-10-12 17:41:40,259 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:41:40,260 INFO L158 Benchmark]: Toolchain (without parser) took 3071.94ms. Allocated memory was 226.5MB in the beginning and 338.7MB in the end (delta: 112.2MB). Free memory was 174.3MB in the beginning and 254.1MB in the end (delta: -79.8MB). Peak memory consumption was 80.1MB. Max. memory is 8.0GB. [2023-10-12 17:41:40,261 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:41:40,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.43ms. Allocated memory is still 226.5MB. Free memory was 174.3MB in the beginning and 172.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:41:40,265 INFO L158 Benchmark]: Boogie Preprocessor took 21.48ms. Allocated memory is still 226.5MB. Free memory was 172.6MB in the beginning and 171.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:41:40,265 INFO L158 Benchmark]: RCFGBuilder took 224.04ms. Allocated memory is still 226.5MB. Free memory was 171.6MB in the beginning and 160.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:41:40,266 INFO L158 Benchmark]: BuchiAutomizer took 2801.83ms. Allocated memory was 226.5MB in the beginning and 338.7MB in the end (delta: 112.2MB). Free memory was 160.8MB in the beginning and 254.1MB in the end (delta: -93.3MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. [2023-10-12 17:41:40,267 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.20ms. Allocated memory is still 226.5MB. Free memory is still 175.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.43ms. Allocated memory is still 226.5MB. Free memory was 174.3MB in the beginning and 172.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.48ms. Allocated memory is still 226.5MB. Free memory was 172.6MB in the beginning and 171.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 224.04ms. Allocated memory is still 226.5MB. Free memory was 171.6MB in the beginning and 160.9MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2801.83ms. Allocated memory was 226.5MB in the beginning and 338.7MB in the end (delta: 112.2MB). Free memory was 160.8MB in the beginning and 254.1MB in the end (delta: -93.3MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * l + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. 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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 270 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 210 IncrementalHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 141 mSDtfsCounter, 210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital59 mio100 ax100 hnf100 lsp76 ukn56 mio100 lsp77 div100 bol100 ite100 ukn100 eq176 hnf94 smp100 dnf133 smp75 tf100 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - 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, 41 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 22 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 394 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 305, independent conditional: 0, independent unconditional: 305, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 197, independent: 187, independent conditional: 0, independent unconditional: 187, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 197, independent: 187, independent conditional: 0, independent unconditional: 187, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 320, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 197, unknown conditional: 0, unknown unconditional: 197] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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:41:40,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...