/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-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:42:42,205 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:42:42,288 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:42,317 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:42:42,318 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:42:42,318 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:42:42,320 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:42:42,320 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:42:42,321 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:42:42,324 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:42:42,325 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:42:42,325 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:42:42,325 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:42:42,326 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:42:42,327 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:42:42,327 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:42:42,327 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:42:42,327 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:42:42,327 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:42:42,328 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:42:42,328 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:42:42,328 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:42:42,329 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:42:42,329 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:42:42,330 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:42:42,330 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:42:42,330 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:42:42,331 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:42:42,331 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:42:42,331 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:42:42,332 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:42:42,332 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:42:42,332 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:42:42,334 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:42:42,334 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,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:42:42,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:42:42,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:42:42,628 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:42:42,629 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:42:42,630 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-sum.wvr.bpl [2023-10-12 17:42:42,631 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl' [2023-10-12 17:42:42,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:42:42,672 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:42:42,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:42,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:42:42,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:42:42,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,698 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:42:42,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:42,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:42:42,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:42:42,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:42:42,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:42:42,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:42:42,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:42:42,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:42:42,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/1) ... [2023-10-12 17:42:42,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:42,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:42,763 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,770 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,801 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:42:42,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:42:42,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:42:42,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:42:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:42:42,806 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:42:42,806 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:42:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:42:42,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:42:42,807 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:42:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:42:42,807 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:42:42,809 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,858 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:42:42,859 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:42:42,988 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:42:43,024 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:42:43,025 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:42:43,027 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:43 BoogieIcfgContainer [2023-10-12 17:42:43,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:42:43,028 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:42:43,028 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:42:43,034 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:42:43,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:43,037 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:42" (1/2) ... [2023-10-12 17:42:43,042 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7070bc31 and model type three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:42:43, skipping insertion in model container [2023-10-12 17:42:43,043 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:43,043 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:43" (2/2) ... [2023-10-12 17:42:43,046 INFO L332 chiAutomizerObserver]: Analyzing ICFG three-array-sum.wvr.bpl [2023-10-12 17:42:43,151 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:42:43,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:42:43,217 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:42:43,217 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:43,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:42:43,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:42:43,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:43,231 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:42:43,263 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:43,269 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:43,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:43,274 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:42:43,275 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:43,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2023-10-12 17:42:43,276 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:42:43,563 INFO L134 LiptonReduction]: Checked pairs total: 178 [2023-10-12 17:42:43,563 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:42:43,576 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:42:43,577 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:42:43,577 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:42:43,577 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:42:43,577 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:42:43,577 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:42:43,577 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:42:43,577 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:42:43,578 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:42:43,582 ERROR L47 etriNetUnfolderRabin]: [1:1A:[110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[][11], 2:2A:[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[103] L25-1-->L25-1: Formula: (and (< v_i_17 v_N_10) (= (+ v_i_17 1) v_i_16) (= v_asum_13 (+ v_asum_14 (select v_A_11 v_i_17))) (= v_bsum_13 (+ (select v_B_11 v_i_17) v_bsum_14))) InVars {A=v_A_11, bsum=v_bsum_14, N=v_N_10, i=v_i_17, asum=v_asum_14, B=v_B_11} OutVars{A=v_A_11, bsum=v_bsum_13, N=v_N_10, i=v_i_16, asum=v_asum_13, B=v_B_11} AuxVars[] AssignedVars[bsum, i, asum][7]] [2023-10-12 17:42:43,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:43,584 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:43,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:43,584 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:43,587 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:42:43,587 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:42:43,588 ERROR L47 etriNetUnfolderRabin]: [1:1A:[110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[][11], 2:2A:[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][2]][3:3A:[103] L25-1-->L25-1: Formula: (and (< v_i_17 v_N_10) (= (+ v_i_17 1) v_i_16) (= v_asum_13 (+ v_asum_14 (select v_A_11 v_i_17))) (= v_bsum_13 (+ (select v_B_11 v_i_17) v_bsum_14))) InVars {A=v_A_11, bsum=v_bsum_14, N=v_N_10, i=v_i_17, asum=v_asum_14, B=v_B_11} OutVars{A=v_A_11, bsum=v_bsum_13, N=v_N_10, i=v_i_16, asum=v_asum_13, B=v_B_11} AuxVars[] AssignedVars[bsum, i, asum][7]] [2023-10-12 17:42:43,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:43,589 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:43,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:43,589 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:43,593 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [2023-10-12 17:42:43,594 INFO L750 eck$LassoCheckResult]: Loop: 43#[L64-1, L25-1]true [103] L25-1-->L25-1: Formula: (and (< v_i_17 v_N_10) (= (+ v_i_17 1) v_i_16) (= v_asum_13 (+ v_asum_14 (select v_A_11 v_i_17))) (= v_bsum_13 (+ (select v_B_11 v_i_17) v_bsum_14))) InVars {A=v_A_11, bsum=v_bsum_14, N=v_N_10, i=v_i_17, asum=v_asum_14, B=v_B_11} OutVars{A=v_A_11, bsum=v_bsum_13, N=v_N_10, i=v_i_16, asum=v_asum_13, B=v_B_11} AuxVars[] AssignedVars[bsum, i, asum] 43#[L64-1, L25-1]true [2023-10-12 17:42:43,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:43,599 INFO L85 PathProgramCache]: Analyzing trace with hash 4462, now seen corresponding path program 1 times [2023-10-12 17:42:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:43,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166618004] [2023-10-12 17:42:43,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:43,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:43,686 INFO L85 PathProgramCache]: Analyzing trace with hash 134, now seen corresponding path program 1 times [2023-10-12 17:42:43,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:43,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870161234] [2023-10-12 17:42:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:43,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:43,751 INFO L85 PathProgramCache]: Analyzing trace with hash 138425, now seen corresponding path program 1 times [2023-10-12 17:42:43,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:43,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275189879] [2023-10-12 17:42:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:43,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:43,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:43,921 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:43,922 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:43,923 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:43,923 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:43,923 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:43,923 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:43,923 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:43,923 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:43,923 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:42:43,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:43,923 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:43,938 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,963 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,966 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,968 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,971 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,974 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,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:44,081 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:44,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,085 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:44,090 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,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,112 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:44,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,132 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:44,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,134 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:44,141 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,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,162 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:44,181 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:44,194 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:42:44,194 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:42:44,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,199 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:44,209 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:44,210 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:44,241 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:44,242 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:44,242 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:42:44,249 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:44,252 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:44,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:44,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:44,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:44,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:44,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:44,310 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,343 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,422 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,427 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,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2023-10-12 17:42:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:42:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:42:44,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:44,433 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 68 transitions, 344 flow [2023-10-12 17:42:44,433 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:44,433 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 68 transitions, 344 flow [2023-10-12 17:42:44,435 ERROR L47 etriNetUnfolderRabin]: [1:1A:[110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[][47], 2:2A:[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][11], 4:3A:[94] L64-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][17]][5:4A:[109] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (= v_k_26 v_p_16) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_A_17 v_k_27) (select v_B_17 v_k_27)))) (< v_k_27 v_N_20)) InVars {A=v_A_17, N=v_N_20, k=v_k_27, C=v_C_23, B=v_B_17} OutVars{A=v_A_17, p=v_p_16, N=v_N_20, k=v_k_26, C=v_C_22, B=v_B_17} AuxVars[] AssignedVars[p, k, C][52]] [2023-10-12 17:42:44,435 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:44,435 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:42:44,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:44,435 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:44,436 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [94] L64-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] 78#[L37-1, L25-1, L65]true [2023-10-12 17:42:44,436 INFO L750 eck$LassoCheckResult]: Loop: 78#[L37-1, L25-1, L65]true [109] L37-1-->L37-1: Formula: (and (= v_k_26 (+ v_k_27 1)) (= v_k_26 v_p_16) (= v_C_22 (store v_C_23 v_k_27 (+ (select v_A_17 v_k_27) (select v_B_17 v_k_27)))) (< v_k_27 v_N_20)) InVars {A=v_A_17, N=v_N_20, k=v_k_27, C=v_C_23, B=v_B_17} OutVars{A=v_A_17, p=v_p_16, N=v_N_20, k=v_k_26, C=v_C_22, B=v_B_17} AuxVars[] AssignedVars[p, k, C] 78#[L37-1, L25-1, L65]true [2023-10-12 17:42:44,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash 138416, now seen corresponding path program 1 times [2023-10-12 17:42:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611909971] [2023-10-12 17:42:44,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2023-10-12 17:42:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731885677] [2023-10-12 17:42:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash 4291005, now seen corresponding path program 1 times [2023-10-12 17:42:44,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:44,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108377945] [2023-10-12 17:42:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,462 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:44,469 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:44,548 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:44,548 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:44,548 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:44,548 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:44,548 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:44,548 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,548 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:44,548 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:44,548 INFO L133 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:42:44,549 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:44,549 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:44,550 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,553 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,555 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,558 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,576 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,579 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,582 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,584 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,587 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,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:44,690 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:44,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,691 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:44,704 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:44,705 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,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,746 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:42:44,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,775 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:44,779 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,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,789 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:44,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,815 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:42:44,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,817 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:44,820 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:44,822 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,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,863 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:44,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,865 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:44,868 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:44,869 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,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:44,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:44,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:44,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,901 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:44,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,903 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,905 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,907 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,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:42:44,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:42:44,915 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:42:44,929 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:44,934 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,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,935 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,938 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,942 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,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:44,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:44,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:44,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:44,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:44,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:44,973 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:44,986 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:42:44,986 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:44,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:44,991 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,992 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,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:45,029 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-10-12 17:42:45,030 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:45,030 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(p, N) = -1*p + 1*N Supporting invariants [-1*p + 1*k >= 0] [2023-10-12 17:42:45,037 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:45,041 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:42:45,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:45,106 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:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:45,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:45,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:45,123 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:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:45,174 WARN L260 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjunts are in the unsatisfiable core [2023-10-12 17:42:45,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:45,174 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:45,175 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2023-10-12 17:42:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2023-10-12 17:42:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) 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:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2023-10-12 17:42:45,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 220 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:45,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:45,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 220 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:42:45,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:45,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 220 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:42:45,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:45,410 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 476 transitions, 3360 flow [2023-10-12 17:42:45,410 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:45,410 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 476 transitions, 3360 flow [2023-10-12 17:42:45,413 ERROR L47 etriNetUnfolderRabin]: [1:1A:[110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[][331], 2:2A:[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][81], 4:3A:[94] L64-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][123], 9:4A:[97] L65-->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][174]][11:5A:[107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[][421]] [2023-10-12 17:42:45,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:45,414 INFO L124 PetriNetUnfolderBase]: 4/10 cut-off events. [2023-10-12 17:42:45,414 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:42:45,414 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:45,415 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [110] $Ultimate##0-->L64: Formula: (and (<= 0 v_N_22) (= v_i_20 0) (= v_i_20 v_k_30) (= v_asum_19 v_i_20) (= v_i_20 v_l_25) (= v_i_20 v_p_18) (= v_i_20 v_csum_15) (= v_i_20 v_bsum_19)) InVars {csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} OutVars{csum=v_csum_15, p=v_p_18, N=v_N_22, bsum=v_bsum_19, l=v_l_25, k=v_k_30, i=v_i_20, asum=v_asum_19} AuxVars[] AssignedVars[] 41#[L64]true [91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L64-1, L25-1]true [94] L64-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] 78#[L37-1, L25-1, L65]true [97] L65-->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] 126#[L66, L37-1, L25-1, L49-1]true [2023-10-12 17:42:45,415 INFO L750 eck$LassoCheckResult]: Loop: 126#[L66, L37-1, L25-1, L49-1]true [107] L49-1-->L49-1: Formula: (and (<= v_p_14 v_l_23) (< v_l_23 v_N_16)) InVars {p=v_p_14, N=v_N_16, l=v_l_23} OutVars{p=v_p_14, N=v_N_16, l=v_l_23} AuxVars[] AssignedVars[] 126#[L66, L37-1, L25-1, L49-1]true [2023-10-12 17:42:45,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 4290993, now seen corresponding path program 1 times [2023-10-12 17:42:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:45,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713498375] [2023-10-12 17:42:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:45,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:45,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 138, now seen corresponding path program 1 times [2023-10-12 17:42:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105038552] [2023-10-12 17:42:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:45,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 133020890, now seen corresponding path program 1 times [2023-10-12 17:42:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:45,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721130126] [2023-10-12 17:42:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,577 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:45,606 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:45 BoogieIcfgContainer [2023-10-12 17:42:45,606 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:45,608 INFO L158 Benchmark]: Toolchain (without parser) took 2934.96ms. Allocated memory was 180.4MB in the beginning and 271.6MB in the end (delta: 91.2MB). Free memory was 135.4MB in the beginning and 208.8MB in the end (delta: -73.4MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. [2023-10-12 17:42:45,608 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.31ms. Allocated memory is still 180.4MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:45,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.83ms. Allocated memory is still 180.4MB. Free memory was 135.3MB in the beginning and 133.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:42:45,613 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:45,614 INFO L158 Benchmark]: RCFGBuilder took 299.08ms. Allocated memory is still 180.4MB. Free memory was 132.6MB in the beginning and 121.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:42:45,615 INFO L158 Benchmark]: BuchiAutomizer took 2578.25ms. Allocated memory was 180.4MB in the beginning and 271.6MB in the end (delta: 91.2MB). Free memory was 121.4MB in the beginning and 208.8MB in the end (delta: -87.5MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. [2023-10-12 17:42:45,619 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.31ms. Allocated memory is still 180.4MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.83ms. Allocated memory is still 180.4MB. Free memory was 135.3MB in the beginning and 133.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 180.4MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 299.08ms. Allocated memory is still 180.4MB. Free memory was 132.6MB in the beginning and 121.7MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 2578.25ms. Allocated memory was 180.4MB in the beginning and 271.6MB in the end (delta: 91.2MB). Free memory was 121.4MB in the beginning and 208.8MB in the end (delta: -87.5MB). Peak memory consumption was 5.6MB. 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 N + -1 * p and consists of 6 locations. The remainder module has 3360 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 188 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 99 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital54 mio100 ax100 hnf100 lsp64 ukn76 mio100 lsp75 div100 bol100 ite100 ukn100 eq172 hnf91 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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 == asum && i == bsum && i == csum && i == 0; [L63] 0 assume 0 <= N; VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L64] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L65] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L66] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] 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 == asum && i == bsum && i == csum && i == 0; [L63] 0 assume 0 <= N; VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L64] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L65] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L66] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] 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, 32 PlacesBefore, 23 PlacesAfterwards, 26 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 108, independent: 104, independent conditional: 0, independent unconditional: 104, 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: 108, independent: 104, independent conditional: 0, independent unconditional: 104, 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: 27, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 166, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 108, unknown conditional: 0, unknown unconditional: 108] , 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:45,646 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...