/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/three-array-min.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:42:41,816 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:42:41,872 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:42:41,899 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:42:41,899 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:42:41,899 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:42:41,901 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:42:41,901 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:42:41,902 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:42:41,904 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:42:41,905 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:42:41,905 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:42:41,905 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:42:41,906 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:42:41,906 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:42:41,906 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:42:41,906 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:42:41,907 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:42:41,907 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:42:41,907 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:42:41,907 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:42:41,907 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:42:41,908 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:42:41,908 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:42:41,909 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:42:41,909 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:42:41,909 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:42:41,909 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:42:41,909 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:42:41,909 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:42:41,910 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:42:41,910 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:42:41,910 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:42:41,912 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:42:41,912 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:42:42,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:42:42,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:42:42,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:42:42,133 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:42:42,133 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:42:42,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl [2023-10-12 17:42:42,141 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl' [2023-10-12 17:42:42,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:42:42,171 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:42:42,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:42,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:42:42,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:42:42,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,195 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:42:42,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:42,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:42:42,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:42:42,198 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:42:42,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:42:42,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:42:42,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:42:42,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:42:42,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:42,249 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:42:42,269 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:42:42,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:42:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:42:42,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:42:42,279 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:42:42,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:42:42,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:42:42,280 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:42:42,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:42:42,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:42:42,280 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:42:42,281 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:42:42,281 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:42:42,281 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:42:42,328 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:42:42,329 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:42:42,404 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:42:42,445 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:42:42,446 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:42:42,447 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:42 BoogieIcfgContainer [2023-10-12 17:42:42,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:42:42,448 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:42:42,448 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:42:42,466 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:42:42,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:42,480 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/2) ... [2023-10-12 17:42:42,481 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6eebab50 and model type three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:42:42, skipping insertion in model container [2023-10-12 17:42:42,481 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:42,481 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:42" (2/2) ... [2023-10-12 17:42:42,482 INFO L332 chiAutomizerObserver]: Analyzing ICFG three-array-min.wvr.bpl [2023-10-12 17:42:42,534 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:42:42,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:42:42,568 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:42:42,569 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:42:42,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 35 transitions, 94 flow [2023-10-12 17:42:42,575 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2023-10-12 17:42:42,577 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:42:42,586 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:42:42,588 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 76 flow [2023-10-12 17:42:42,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 76 flow [2023-10-12 17:42:42,593 INFO L124 PetriNetUnfolderBase]: 4/29 cut-off events. [2023-10-12 17:42:42,593 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:42,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:42:42,594 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:42:42,900 INFO L134 LiptonReduction]: Checked pairs total: 212 [2023-10-12 17:42:42,900 INFO L136 LiptonReduction]: Total number of compositions: 14 [2023-10-12 17:42:42,911 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:42:42,911 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:42:42,912 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:42:42,912 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:42:42,912 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:42:42,912 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:42:42,912 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:42:42,912 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:42:42,913 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:42:42,917 ERROR L47 etriNetUnfolderRabin]: [1:1A:[120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[][16], 2:2A:[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[110] L25-1-->L25-1: Formula: (and (= v_mina_15 (let ((.cse0 (select v_A_15 v_i_17))) (ite (< v_mina_16 .cse0) v_mina_16 .cse0))) (= v_minb_13 (let ((.cse1 (select v_B_13 v_i_17))) (ite (< v_minb_14 .cse1) v_minb_14 .cse1))) (= (+ v_i_17 1) v_i_16) (< v_i_17 v_N_12)) InVars {minb=v_minb_14, A=v_A_15, mina=v_mina_16, N=v_N_12, i=v_i_17, B=v_B_13} OutVars{minb=v_minb_13, A=v_A_15, mina=v_mina_15, N=v_N_12, i=v_i_16, B=v_B_13} AuxVars[] AssignedVars[minb, mina, i][7]] [2023-10-12 17:42:42,918 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:42,919 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:42,920 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:42,920 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:42,923 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:42:42,923 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:42:42,925 ERROR L47 etriNetUnfolderRabin]: [1:1A:[120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[][16], 2:2A:[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[110] L25-1-->L25-1: Formula: (and (= v_mina_15 (let ((.cse0 (select v_A_15 v_i_17))) (ite (< v_mina_16 .cse0) v_mina_16 .cse0))) (= v_minb_13 (let ((.cse1 (select v_B_13 v_i_17))) (ite (< v_minb_14 .cse1) v_minb_14 .cse1))) (= (+ v_i_17 1) v_i_16) (< v_i_17 v_N_12)) InVars {minb=v_minb_14, A=v_A_15, mina=v_mina_16, N=v_N_12, i=v_i_17, B=v_B_13} OutVars{minb=v_minb_13, A=v_A_15, mina=v_mina_15, N=v_N_12, i=v_i_16, B=v_B_13} AuxVars[] AssignedVars[minb, mina, i][7]] [2023-10-12 17:42:42,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:42,926 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:42,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:42,926 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:42,931 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]true [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L67-1, L25-1]true [2023-10-12 17:42:42,935 INFO L750 eck$LassoCheckResult]: Loop: 46#[L67-1, L25-1]true [110] L25-1-->L25-1: Formula: (and (= v_mina_15 (let ((.cse0 (select v_A_15 v_i_17))) (ite (< v_mina_16 .cse0) v_mina_16 .cse0))) (= v_minb_13 (let ((.cse1 (select v_B_13 v_i_17))) (ite (< v_minb_14 .cse1) v_minb_14 .cse1))) (= (+ v_i_17 1) v_i_16) (< v_i_17 v_N_12)) InVars {minb=v_minb_14, A=v_A_15, mina=v_mina_16, N=v_N_12, i=v_i_17, B=v_B_13} OutVars{minb=v_minb_13, A=v_A_15, mina=v_mina_15, N=v_N_12, i=v_i_16, B=v_B_13} AuxVars[] AssignedVars[minb, mina, i] 46#[L67-1, L25-1]true [2023-10-12 17:42:42,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash 4778, now seen corresponding path program 1 times [2023-10-12 17:42:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:42,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5493632] [2023-10-12 17:42:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:43,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:42:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414700993] [2023-10-12 17:42:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:43,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:43,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash 148228, now seen corresponding path program 1 times [2023-10-12 17:42:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164309868] [2023-10-12 17:42:43,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:43,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:43,247 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:43,248 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:43,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:43,248 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:43,248 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:43,248 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,249 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:43,249 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:43,249 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:42:43,249 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:43,249 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:43,263 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:42:43,269 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:42:43,271 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:42:43,273 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:42:43,276 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:42:43,532 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:43,535 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:43,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:43,539 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:42:43,552 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:42:43,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:43,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:43,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:43,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:43,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:43,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:43,565 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:42:43,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:43,583 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:42:43,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:43,585 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:42:43,587 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:42:43,589 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:42:43,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:43,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:43,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:43,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:43,598 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:43,598 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:43,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:43,617 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:42:43,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:43,619 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:42:43,620 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:42:43,636 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:42:43,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:43,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:43,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:43,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:43,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:43,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:43,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:43,664 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:42:43,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:43,667 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:42:43,673 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:42:43,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:43,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:43,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:43,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:43,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:43,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:43,697 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:42:43,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:43,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:42:43,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:43,705 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:42:43,707 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:42:43,709 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:42:43,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:43,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:43,716 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:42:43,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:43,753 INFO L401 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2023-10-12 17:42:43,753 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:42:43,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:43,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:42:43,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:43,816 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:42:43,823 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:42:43,823 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:42:43,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:43,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:43,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:43,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:43,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:43,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:43,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:43,882 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:42:43,883 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:42:43,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:43,886 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:42:43,887 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:42:43,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:43,898 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:43,898 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:43,899 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:42:43,906 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:42:43,910 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:43,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:43,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:43,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:43,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:43,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:43,957 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:42:43,987 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:42:44,098 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:42:44,101 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:42:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2023-10-12 17:42:44,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:42:44,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:44,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:42:44,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,106 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 68 transitions, 344 flow [2023-10-12 17:42:44,106 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:44,106 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 68 transitions, 344 flow [2023-10-12 17:42:44,107 ERROR L47 etriNetUnfolderRabin]: [1:1A:[120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[][65], 2:2A:[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][9], 4:3A:[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][22]][5:4A:[115] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (< v_k_27 v_N_22) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_B_19 v_k_27) (select v_A_21 v_k_27)))) (= v_k_26 v_p_16)) InVars {A=v_A_21, N=v_N_22, k=v_k_27, C=v_C_23, B=v_B_19} OutVars{A=v_A_21, p=v_p_16, N=v_N_22, k=v_k_26, C=v_C_22, B=v_B_19} AuxVars[] AssignedVars[p, k, C][35]] [2023-10-12 17:42:44,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:44,108 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:42:44,108 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:44,108 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:44,108 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]true [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L67-1, L25-1]true [100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[L37-1, L68, L25-1]true [2023-10-12 17:42:44,108 INFO L750 eck$LassoCheckResult]: Loop: 81#[L37-1, L68, L25-1]true [115] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (< v_k_27 v_N_22) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_B_19 v_k_27) (select v_A_21 v_k_27)))) (= v_k_26 v_p_16)) InVars {A=v_A_21, N=v_N_22, k=v_k_27, C=v_C_23, B=v_B_19} OutVars{A=v_A_21, p=v_p_16, N=v_N_22, k=v_k_26, C=v_C_22, B=v_B_19} AuxVars[] AssignedVars[p, k, C] 81#[L37-1, L68, L25-1]true [2023-10-12 17:42:44,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,109 INFO L85 PathProgramCache]: Analyzing trace with hash 148218, now seen corresponding path program 1 times [2023-10-12 17:42:44,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996498372] [2023-10-12 17:42:44,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash 146, now seen corresponding path program 1 times [2023-10-12 17:42:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039223972] [2023-10-12 17:42:44,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash 4594873, now seen corresponding path program 1 times [2023-10-12 17:42:44,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975799509] [2023-10-12 17:42:44,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,277 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:44,277 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:44,277 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:44,277 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:44,277 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:44,277 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,277 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:44,277 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:44,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-min.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:42:44,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:44,278 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:44,279 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:42:44,282 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:42:44,284 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:42:44,305 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:42:44,308 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:42:44,310 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:42:44,388 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:44,388 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:44,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,390 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:42:44,392 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:42:44,395 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:42:44,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,418 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:42:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,420 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:42:44,422 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:42:44,424 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:42:44,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,453 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:42:44,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,456 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:42:44,473 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:42:44,473 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:42:44,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,499 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:44,511 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:42:44,511 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:42:44,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,514 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:42:44,518 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:42:44,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:44,539 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:44,539 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:44,539 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:42:44,543 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:42:44,544 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:44,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:44,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:44,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:44,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:44,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:44,572 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:42:44,573 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:42:44,654 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:42:44,655 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:42:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2023-10-12 17:42:44,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:44,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:42:44,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 196 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:42:44,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,658 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 272 transitions, 1920 flow [2023-10-12 17:42:44,658 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:44,659 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 272 transitions, 1920 flow [2023-10-12 17:42:44,662 ERROR L47 etriNetUnfolderRabin]: [1:1A:[120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[][262], 2:2A:[97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][38], 4:3A:[100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][90], 7:4A:[103] L68-->L49-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][77]][8:5A:[113] L49-1-->L49-1: Formula: (and (< v_l_23 v_N_18) (<= v_p_14 v_l_23)) InVars {p=v_p_14, N=v_N_18, l=v_l_23} OutVars{p=v_p_14, N=v_N_18, l=v_l_23} AuxVars[] AssignedVars[][175]] [2023-10-12 17:42:44,662 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:44,662 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2023-10-12 17:42:44,662 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:42:44,662 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:44,663 INFO L748 eck$LassoCheckResult]: Stem: 42#[$Ultimate##0]true [120] $Ultimate##0-->L67: Formula: (let ((.cse0 (select v_B_27 0)) (.cse1 (select v_A_31 0))) (and (<= 0 v_N_30) (= (+ .cse0 .cse1) v_minc_23) (= v_i_22 v_k_40) (= .cse0 v_minb_23) (= v_i_22 v_l_33) (= .cse1 v_mina_25) (= v_i_22 v_p_25) (= v_i_22 1))) InVars {A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} OutVars{A=v_A_31, minb=v_minb_23, minc=v_minc_23, p=v_p_25, mina=v_mina_25, N=v_N_30, l=v_l_33, k=v_k_40, i=v_i_22, B=v_B_27} AuxVars[] AssignedVars[] 44#[L67]true [97] L67-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L67-1, L25-1]true [100] L67-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 81#[L37-1, L68, L25-1]true [103] L68-->L49-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] 115#[L37-1, L69, L25-1, L49-1]true [2023-10-12 17:42:44,663 INFO L750 eck$LassoCheckResult]: Loop: 115#[L37-1, L69, L25-1, L49-1]true [113] L49-1-->L49-1: Formula: (and (< v_l_23 v_N_18) (<= v_p_14 v_l_23)) InVars {p=v_p_14, N=v_N_18, l=v_l_23} OutVars{p=v_p_14, N=v_N_18, l=v_l_23} AuxVars[] AssignedVars[] 115#[L37-1, L69, L25-1, L49-1]true [2023-10-12 17:42:44,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash 4594861, now seen corresponding path program 1 times [2023-10-12 17:42:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232662095] [2023-10-12 17:42:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 144, now seen corresponding path program 1 times [2023-10-12 17:42:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989784959] [2023-10-12 17:42:44,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,676 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,678 INFO L85 PathProgramCache]: Analyzing trace with hash 142440804, now seen corresponding path program 1 times [2023-10-12 17:42:44,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858806323] [2023-10-12 17:42:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,843 INFO L201 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:44 BoogieIcfgContainer [2023-10-12 17:42:44,843 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:44,844 INFO L158 Benchmark]: Toolchain (without parser) took 2672.18ms. Allocated memory was 189.8MB in the beginning and 349.2MB in the end (delta: 159.4MB). Free memory was 142.5MB in the beginning and 189.1MB in the end (delta: -46.7MB). Peak memory consumption was 113.3MB. Max. memory is 8.0GB. [2023-10-12 17:42:44,844 INFO L158 Benchmark]: Boogie PL CUP Parser took 6.39ms. Allocated memory is still 189.8MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:44,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.29ms. Allocated memory is still 189.8MB. Free memory was 142.3MB in the beginning and 140.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:44,847 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 189.8MB. Free memory was 140.8MB in the beginning and 139.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:44,848 INFO L158 Benchmark]: RCFGBuilder took 226.28ms. Allocated memory is still 189.8MB. Free memory was 139.7MB in the beginning and 163.0MB in the end (delta: -23.3MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. [2023-10-12 17:42:44,849 INFO L158 Benchmark]: BuchiAutomizer took 2395.03ms. Allocated memory was 189.8MB in the beginning and 349.2MB in the end (delta: 159.4MB). Free memory was 163.0MB in the beginning and 189.1MB in the end (delta: -26.1MB). Peak memory consumption was 132.8MB. Max. memory is 8.0GB. [2023-10-12 17:42:44,855 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 6.39ms. Allocated memory is still 189.8MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.29ms. Allocated memory is still 189.8MB. Free memory was 142.3MB in the beginning and 140.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 189.8MB. Free memory was 140.8MB in the beginning and 139.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 226.28ms. Allocated memory is still 189.8MB. Free memory was 139.7MB in the beginning and 163.0MB in the end (delta: -23.3MB). Peak memory consumption was 18.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 2395.03ms. Allocated memory was 189.8MB in the beginning and 349.2MB in the end (delta: 159.4MB). Free memory was 163.0MB in the beginning and 189.1MB in the end (delta: -26.1MB). Peak memory consumption was 132.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. The remainder module has 1920 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 84 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital78 mio100 ax100 hnf100 lsp103 ukn55 mio100 lsp70 div100 bol100 ite100 ukn100 eq177 hnf92 smp100 dnf291 smp65 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 106ms VariablesStem: 5 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; [L63] 0 assume 0 <= N; [L64] 0 assume mina == A[0]; [L65] 0 assume minb == B[0]; [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L62] 0 assume i == k && i == l && i == p && i == 1; [L63] 0 assume 0 <= N; [L64] 0 assume mina == A[0]; [L65] 0 assume minb == B[0]; [L66] 0 assume minc == A[0] + B[0]; VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L67] FORK 0 fork 1 thread1(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L68] FORK 0 fork 2, 2 thread2(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] [L69] FORK 0 fork 3, 3, 3 thread3(); VAL [N=2, i=1, k=1, l=1, mina=0, minb=0, minc=0, p=1] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 23 PlacesAfterwards, 29 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 212 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, independent: 200, independent conditional: 0, independent unconditional: 200, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 110, unknown conditional: 0, unknown unconditional: 110] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:42:44,882 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:42:45,083 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:42:45,285 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...