/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-more/min-le-max.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:31,547 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:31,607 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:40:31,632 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:31,632 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:31,633 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:31,634 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:31,634 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:31,635 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:31,638 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:31,638 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:31,638 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:31,638 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:31,639 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:31,639 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:31,639 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:31,639 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:31,640 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:31,640 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:31,640 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:31,640 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:31,640 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:31,641 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:31,641 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:31,641 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:31,641 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:31,641 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:31,641 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:31,642 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:31,642 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:31,642 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:31,643 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:31,643 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:31,644 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:31,644 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:40:31,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:31,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:31,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:31,837 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:31,838 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:31,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-le-max.wvr.bpl [2023-10-12 17:40:31,839 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-le-max.wvr.bpl' [2023-10-12 17:40:31,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:31,861 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:31,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:31,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:31,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:31,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,884 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:31,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:31,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:31,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:31,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:31,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:31,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:31,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:31,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:31,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/1) ... [2023-10-12 17:40:31,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:31,933 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:40:31,957 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:40:31,985 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:31,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:31,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:31,986 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:31,987 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:40:32,038 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:32,039 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:32,190 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:32,195 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:32,195 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:32,197 INFO L201 PluginConnector]: Adding new model min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:32 BoogieIcfgContainer [2023-10-12 17:40:32,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:32,197 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:32,198 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:32,200 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:32,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:32,201 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:31" (1/2) ... [2023-10-12 17:40:32,202 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b14152f and model type min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:32, skipping insertion in model container [2023-10-12 17:40:32,202 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:32,202 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:32" (2/2) ... [2023-10-12 17:40:32,203 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-le-max.wvr.bpl [2023-10-12 17:40:32,244 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:40:32,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 82 flow [2023-10-12 17:40:32,277 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2023-10-12 17:40:32,277 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:32,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 2/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:32,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 29 transitions, 82 flow [2023-10-12 17:40:32,283 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 23 transitions, 64 flow [2023-10-12 17:40:32,285 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:32,295 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 64 flow [2023-10-12 17:40:32,297 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 64 flow [2023-10-12 17:40:32,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 64 flow [2023-10-12 17:40:32,306 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2023-10-12 17:40:32,306 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:32,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 2/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:32,307 INFO L119 LiptonReduction]: Number of co-enabled transitions 138 [2023-10-12 17:40:32,502 INFO L134 LiptonReduction]: Checked pairs total: 132 [2023-10-12 17:40:32,502 INFO L136 LiptonReduction]: Total number of compositions: 10 [2023-10-12 17:40:32,512 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:32,513 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:32,513 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:32,513 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:32,513 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:32,513 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:32,513 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:32,513 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:32,514 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 14 transitions, 46 flow [2023-10-12 17:40:32,516 ERROR L47 etriNetUnfolderRabin]: [1:1A:[47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} OutVars{A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} AuxVars[] AssignedVars[][5], 2:2A:[66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6]][3:3A:[84] L20-->L20: Formula: (and (= (let ((.cse0 (select v_A_16 v_i_16))) (ite (< v_min_22 .cse0) v_min_22 .cse0)) v_min_21) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_15)) InVars {A=v_A_16, N=v_N_15, i=v_i_16, min=v_min_22} OutVars{A=v_A_16, N=v_N_15, i=v_i_15, min=v_min_21} AuxVars[] AssignedVars[i, min][12]] [2023-10-12 17:40:32,518 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:32,518 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:32,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:32,518 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:32,520 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:32,520 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 14 transitions, 46 flow [2023-10-12 17:40:32,521 ERROR L47 etriNetUnfolderRabin]: [1:1A:[47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} OutVars{A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} AuxVars[] AssignedVars[][5], 2:2A:[66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][6]][3:3A:[84] L20-->L20: Formula: (and (= (let ((.cse0 (select v_A_16 v_i_16))) (ite (< v_min_22 .cse0) v_min_22 .cse0)) v_min_21) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_15)) InVars {A=v_A_16, N=v_N_15, i=v_i_16, min=v_min_22} OutVars{A=v_A_16, N=v_N_15, i=v_i_15, min=v_min_21} AuxVars[] AssignedVars[i, min][12]] [2023-10-12 17:40:32,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:32,521 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:32,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:32,522 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:32,525 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} OutVars{A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} AuxVars[] AssignedVars[] 40#[L45]true [66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 42#[L20, L45-1]true [2023-10-12 17:40:32,525 INFO L750 eck$LassoCheckResult]: Loop: 42#[L20, L45-1]true [84] L20-->L20: Formula: (and (= (let ((.cse0 (select v_A_16 v_i_16))) (ite (< v_min_22 .cse0) v_min_22 .cse0)) v_min_21) (= v_i_15 (+ v_i_16 1)) (< v_i_16 v_N_15)) InVars {A=v_A_16, N=v_N_15, i=v_i_16, min=v_min_22} OutVars{A=v_A_16, N=v_N_15, i=v_i_15, min=v_min_21} AuxVars[] AssignedVars[i, min] 42#[L20, L45-1]true [2023-10-12 17:40:32,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2484, now seen corresponding path program 1 times [2023-10-12 17:40:32,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399888582] [2023-10-12 17:40:32,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 115, now seen corresponding path program 1 times [2023-10-12 17:40:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630558828] [2023-10-12 17:40:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash 77088, now seen corresponding path program 1 times [2023-10-12 17:40:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:32,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379172655] [2023-10-12 17:40:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:32,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:32,778 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:32,778 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:32,779 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:32,779 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:32,779 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:32,779 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,779 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:32,779 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:32,779 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-le-max.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:32,779 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:32,779 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:32,790 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:40:32,797 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:40:32,799 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:40:32,802 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:40:32,923 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:32,926 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:32,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:32,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,077 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:40:33,080 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:40:33,081 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:40:33,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,127 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:40:33,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,129 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:40:33,173 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:40:33,174 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:40:33,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,205 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:40:33,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,208 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:40:33,224 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:40:33,225 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:40:33,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,244 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,265 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:40:33,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,267 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:40:33,276 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:40:33,277 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:40:33,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,285 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:40:33,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,311 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:40:33,311 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:40:33,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,355 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:40:33,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,371 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:40:33,384 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:40:33,386 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:40:33,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:33,417 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:40:33,417 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:40:33,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,429 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:40:33,430 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:40:33,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:33,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:33,470 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:33,471 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:33,475 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:40:33,477 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:33,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:33,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:33,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:33,514 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:33,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:33,515 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:40:33,534 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:40:33,597 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:40:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-10-12 17:40:33,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:33,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:33,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:33,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:33,610 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 56 transitions, 296 flow [2023-10-12 17:40:33,610 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:33,610 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 56 transitions, 296 flow [2023-10-12 17:40:33,612 ERROR L47 etriNetUnfolderRabin]: [1:1A:[47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} OutVars{A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} AuxVars[] AssignedVars[][20], 2:2A:[66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][24], 4:3A:[69] L45-1-->L29: 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][15]][5:4A:[83] L29-->L29: Formula: (and (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< .cse0 v_max_18) v_max_18 .cse0)) v_max_17) (= v_j_15 (+ v_j_16 1)) (< v_j_16 v_N_11)) InVars {A=v_A_12, N=v_N_11, j=v_j_16, max=v_max_18} OutVars{A=v_A_12, N=v_N_11, j=v_j_15, max=v_max_17} AuxVars[] AssignedVars[j, max][46]] [2023-10-12 17:40:33,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:33,613 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:33,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:33,613 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:33,614 INFO L748 eck$LassoCheckResult]: Stem: 38#[$Ultimate##0]true [47] $Ultimate##0-->L45: Formula: (let ((.cse0 (select v_A_3 0))) (and (= v_min_3 .cse0) (= v_i_6 0) (= v_j_6 v_i_6) (not v_v_assert_1) (= v_max_3 .cse0))) InVars {A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} OutVars{A=v_A_3, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1, min=v_min_3, max=v_max_3} AuxVars[] AssignedVars[] 40#[L45]true [66] L45-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 42#[L20, L45-1]true [69] L45-1-->L29: 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] 77#[L46, L20, L29]true [2023-10-12 17:40:33,614 INFO L750 eck$LassoCheckResult]: Loop: 77#[L46, L20, L29]true [83] L29-->L29: Formula: (and (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< .cse0 v_max_18) v_max_18 .cse0)) v_max_17) (= v_j_15 (+ v_j_16 1)) (< v_j_16 v_N_11)) InVars {A=v_A_12, N=v_N_11, j=v_j_16, max=v_max_18} OutVars{A=v_A_12, N=v_N_11, j=v_j_15, max=v_max_17} AuxVars[] AssignedVars[j, max] 77#[L46, L20, L29]true [2023-10-12 17:40:33,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 77073, now seen corresponding path program 1 times [2023-10-12 17:40:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019532650] [2023-10-12 17:40:33,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:33,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:33,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:33,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2023-10-12 17:40:33,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:33,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771442210] [2023-10-12 17:40:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:33,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:33,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:33,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:33,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2389346, now seen corresponding path program 1 times [2023-10-12 17:40:33,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:33,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670275484] [2023-10-12 17:40:33,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:33,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:33,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:33,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:33,752 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:33,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:33,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:33,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:33,752 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:33,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,755 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:33,755 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:33,755 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-le-max.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:40:33,755 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:33,755 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:33,757 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:40:33,760 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:40:33,762 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:40:33,798 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:40:33,815 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:40:33,818 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:40:33,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:40:33,920 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:33,920 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:33,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,933 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:40:33,934 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:40:33,947 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:40:33,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:33,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:33,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:33,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:33,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:33,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:33,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:33,980 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:40:33,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:33,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:33,997 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:40:34,000 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:40:34,002 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:40:34,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:34,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:34,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:34,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:34,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:34,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:34,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:34,034 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:40:34,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:34,035 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:40:34,036 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:40:34,039 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:40:34,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:34,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:34,046 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:40:34,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:34,053 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:40:34,053 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:40:34,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:34,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:34,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:34,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:34,079 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:40:34,097 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:40:34,104 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:40:34,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:34,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:34,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:34,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:34,108 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:34,108 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:34,121 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:34,125 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:40:34,125 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:40:34,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:34,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:34,133 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:40:34,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:34,166 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:40:34,175 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:34,175 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:34,175 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2023-10-12 17:40:34,192 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:40:34,193 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:34,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:34,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:34,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:34,215 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:34,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:34,215 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:40:34,216 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:40:34,267 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:40:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:40:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-10-12 17:40:34,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:34,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:34,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:34,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:34,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 156 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:34,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:34,269 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 224 transitions, 1632 flow [2023-10-12 17:40:34,269 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:34,269 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 224 transitions, 1632 flow [2023-10-12 17:40:34,283 INFO L124 PetriNetUnfolderBase]: 63/100 cut-off events. [2023-10-12 17:40:34,283 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-10-12 17:40:34,283 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:34,287 INFO L201 PluginConnector]: Adding new model min-le-max.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:34 BoogieIcfgContainer [2023-10-12 17:40:34,287 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:34,288 INFO L158 Benchmark]: Toolchain (without parser) took 2426.59ms. Allocated memory was 178.3MB in the beginning and 275.8MB in the end (delta: 97.5MB). Free memory was 134.0MB in the beginning and 218.5MB in the end (delta: -84.4MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2023-10-12 17:40:34,288 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 178.3MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:34,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.24ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 132.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:34,289 INFO L158 Benchmark]: Boogie Preprocessor took 12.55ms. Allocated memory is still 178.3MB. Free memory was 132.3MB in the beginning and 131.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:34,289 INFO L158 Benchmark]: RCFGBuilder took 297.96ms. Allocated memory is still 178.3MB. Free memory was 131.3MB in the beginning and 122.0MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:40:34,289 INFO L158 Benchmark]: BuchiAutomizer took 2090.00ms. Allocated memory was 178.3MB in the beginning and 275.8MB in the end (delta: 97.5MB). Free memory was 121.8MB in the beginning and 218.5MB in the end (delta: -96.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:40:34,291 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.24ms. Allocated memory is still 178.3MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.24ms. Allocated memory is still 178.3MB. Free memory was 133.9MB in the beginning and 132.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.55ms. Allocated memory is still 178.3MB. Free memory was 132.3MB in the beginning and 131.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 297.96ms. Allocated memory is still 178.3MB. Free memory was 131.3MB in the beginning and 122.0MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2090.00ms. Allocated memory was 178.3MB in the beginning and 275.8MB in the end (delta: 97.5MB). Free memory was 121.8MB in the beginning and 218.5MB in the end (delta: -96.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i 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.0s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.0s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 74 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp114 ukn57 mio100 lsp69 div100 bol100 ite100 ukn100 eq179 hnf93 smp100 dnf142 smp66 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 75ms VariablesStem: 4 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.2s, 31 PlacesBefore, 22 PlacesAfterwards, 23 TransitionsBefore, 14 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 132 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 109, independent conditional: 0, independent unconditional: 109, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 87, unknown conditional: 0, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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:40:34,303 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:40:34,507 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...