/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/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:42:33,651 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:42:33,726 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:33,754 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:42:33,755 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:42:33,755 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:42:33,756 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:42:33,757 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:42:33,757 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:42:33,757 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:42:33,758 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:42:33,758 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:42:33,758 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:42:33,759 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:42:33,759 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:42:33,759 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:42:33,760 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:42:33,760 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:42:33,760 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:42:33,761 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:42:33,761 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:42:33,761 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:42:33,762 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:42:33,762 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:42:33,762 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:42:33,763 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:42:33,763 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:42:33,763 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:42:33,763 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:42:33,764 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:42:33,764 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:42:33,764 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:42:33,764 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:42:33,765 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:42:33,765 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:33,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:42:33,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:42:33,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:42:33,978 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:42:33,979 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:42:33,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2023-10-12 17:42:33,981 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2023-10-12 17:42:34,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:42:34,013 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:42:34,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:34,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:42:34,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:42:34,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,039 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:42:34,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:42:34,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:42:34,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:42:34,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:42:34,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,062 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:42:34,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:42:34,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:42:34,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:42:34,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/1) ... [2023-10-12 17:42:34,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:34,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:34,114 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:34,131 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:34,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:42:34,151 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:42:34,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:42:34,152 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:42:34,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:42:34,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:42:34,152 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:42:34,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:42:34,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:42:34,156 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:42:34,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:42:34,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:42:34,158 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:34,198 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:42:34,200 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:42:34,298 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:42:34,315 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:42:34,315 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:42:34,317 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:34 BoogieIcfgContainer [2023-10-12 17:42:34,318 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:42:34,318 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:42:34,319 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:42:34,324 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:42:34,324 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:34,325 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:42:34" (1/2) ... [2023-10-12 17:42:34,326 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@735509a0 and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:42:34, skipping insertion in model container [2023-10-12 17:42:34,326 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:42:34,326 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:42:34" (2/2) ... [2023-10-12 17:42:34,327 INFO L332 chiAutomizerObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2023-10-12 17:42:34,398 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:42:34,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:42:34,439 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:42:34,439 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:34,442 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 5. Compared 40 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:34,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 88 flow [2023-10-12 17:42:34,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:34,461 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:42:34,472 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:34,474 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:34,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 70 flow [2023-10-12 17:42:34,482 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-10-12 17:42:34,482 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:42:34,482 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 5. Compared 40 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:34,483 INFO L119 LiptonReduction]: Number of co-enabled transitions 184 [2023-10-12 17:42:34,705 INFO L134 LiptonReduction]: Checked pairs total: 146 [2023-10-12 17:42:34,706 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:42:34,718 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:42:34,718 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:42:34,718 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:42:34,718 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:42:34,718 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:42:34,718 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:42:34,718 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:42:34,719 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:42:34,719 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:42:34,722 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[][11], 2:2A:[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[107] L23-1-->L23-1: Formula: (and (< v_i_14 v_N_25) (= v_i_13 (+ v_i_14 1)) (= v_asum_13 (+ (select v_A_11 v_i_14) v_asum_14))) InVars {A=v_A_11, N=v_N_25, i=v_i_14, asum=v_asum_14} OutVars{A=v_A_11, N=v_N_25, i=v_i_13, asum=v_asum_13} AuxVars[] AssignedVars[i, asum][8]] [2023-10-12 17:42:34,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:34,724 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:34,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:34,725 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:34,727 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:42:34,727 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 23 places, 17 transitions, 52 flow [2023-10-12 17:42:34,729 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[][11], 2:2A:[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[107] L23-1-->L23-1: Formula: (and (< v_i_14 v_N_25) (= v_i_13 (+ v_i_14 1)) (= v_asum_13 (+ (select v_A_11 v_i_14) v_asum_14))) InVars {A=v_A_11, N=v_N_25, i=v_i_14, asum=v_asum_14} OutVars{A=v_A_11, N=v_N_25, i=v_i_13, asum=v_asum_13} AuxVars[] AssignedVars[i, asum][8]] [2023-10-12 17:42:34,729 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:34,729 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:42:34,729 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:34,730 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:34,734 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [2023-10-12 17:42:34,734 INFO L750 eck$LassoCheckResult]: Loop: 43#[L23-1, L61-1]true [107] L23-1-->L23-1: Formula: (and (< v_i_14 v_N_25) (= v_i_13 (+ v_i_14 1)) (= v_asum_13 (+ (select v_A_11 v_i_14) v_asum_14))) InVars {A=v_A_11, N=v_N_25, i=v_i_14, asum=v_asum_14} OutVars{A=v_A_11, N=v_N_25, i=v_i_13, asum=v_asum_13} AuxVars[] AssignedVars[i, asum] 43#[L23-1, L61-1]true [2023-10-12 17:42:34,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash 4398, now seen corresponding path program 1 times [2023-10-12 17:42:34,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:34,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827436508] [2023-10-12 17:42:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:34,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:34,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:34,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:34,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:34,836 INFO L85 PathProgramCache]: Analyzing trace with hash 138, now seen corresponding path program 1 times [2023-10-12 17:42:34,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487834175] [2023-10-12 17:42:34,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:34,846 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:34,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:34,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 136445, now seen corresponding path program 1 times [2023-10-12 17:42:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:34,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773034248] [2023-10-12 17:42:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:34,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:34,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:34,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:34,972 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:34,973 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:34,973 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:34,973 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:34,973 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:34,973 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:34,973 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:34,973 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:34,973 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:42:34,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:34,974 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:34,987 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:34,995 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:34,998 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:35,020 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:35,024 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:35,027 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:35,123 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:35,126 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:35,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:35,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:35,135 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:35,142 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:35,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:35,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:35,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:35,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:35,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:35,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:35,166 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:35,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:35,185 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:35,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:35,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:35,189 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:35,197 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:35,198 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:35,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:35,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:35,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:35,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:35,210 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:35,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:35,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:35,233 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:35,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:35,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:35,237 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:35,246 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:35,247 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:35,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:35,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:35,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:35,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:35,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:35,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:35,298 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:35,308 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:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:35,309 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:35,311 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:35,313 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:35,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:35,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:35,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:35,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:35,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:35,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:35,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:35,364 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:42:35,365 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:42:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:35,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:35,377 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:35,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:35,412 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:35,427 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:35,428 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:35,428 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:42:35,436 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:35,439 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:35,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:35,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:35,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:35,503 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:35,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:35,504 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:35,543 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:35,648 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:35,654 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:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2023-10-12 17:42:35,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:42:35,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:35,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:35,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:35,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:42:35,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:35,664 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 68 transitions, 344 flow [2023-10-12 17:42:35,664 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:42:35,664 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 68 transitions, 344 flow [2023-10-12 17:42:35,669 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[][47], 2:2A:[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3], 4:3A:[92] L61-1-->L34-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][13]][5:4A:[105] L34-1-->L34-1: Formula: (and (= v_k_18 (+ v_k_19 1)) (= v_C_14 (store v_C_15 v_k_19 (+ (select v_A_9 v_k_19) 1))) (< v_k_19 v_N_21) (= v_k_18 v_p_11)) InVars {A=v_A_9, N=v_N_21, k=v_k_19, C=v_C_15} OutVars{A=v_A_9, p=v_p_11, N=v_N_21, k=v_k_18, C=v_C_14} AuxVars[] AssignedVars[p, k, C][56]] [2023-10-12 17:42:35,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:35,670 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:42:35,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:42:35,670 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:35,671 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [92] L61-1-->L34-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#[L23-1, L34-1, L62]true [2023-10-12 17:42:35,671 INFO L750 eck$LassoCheckResult]: Loop: 78#[L23-1, L34-1, L62]true [105] L34-1-->L34-1: Formula: (and (= v_k_18 (+ v_k_19 1)) (= v_C_14 (store v_C_15 v_k_19 (+ (select v_A_9 v_k_19) 1))) (< v_k_19 v_N_21) (= v_k_18 v_p_11)) InVars {A=v_A_9, N=v_N_21, k=v_k_19, C=v_C_15} OutVars{A=v_A_9, p=v_p_11, N=v_N_21, k=v_k_18, C=v_C_14} AuxVars[] AssignedVars[p, k, C] 78#[L23-1, L34-1, L62]true [2023-10-12 17:42:35,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash 136430, now seen corresponding path program 1 times [2023-10-12 17:42:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384014481] [2023-10-12 17:42:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:35,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:35,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:35,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash 136, now seen corresponding path program 1 times [2023-10-12 17:42:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258703012] [2023-10-12 17:42:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:35,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:35,725 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:35,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash 4229435, now seen corresponding path program 1 times [2023-10-12 17:42:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197314246] [2023-10-12 17:42:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:35,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:35,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:35,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:35,891 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:35,892 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:42:35,892 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:42:35,892 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:42:35,893 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:42:35,893 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:42:35,893 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:35,893 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:42:35,893 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:42:35,893 INFO L133 ssoRankerPreferences]: Filename of dumped script: simple-array-sum.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:42:35,893 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:42:35,893 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:42:35,894 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:35,897 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:35,900 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:35,902 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:35,905 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:35,918 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:35,921 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:35,923 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:36,015 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:42:36,015 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:42:36,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:36,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:36,017 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:36,020 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:36,021 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:36,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:36,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:36,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:36,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:36,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:36,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:36,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:36,052 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:36,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:36,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:36,054 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:36,068 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:36,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:36,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:36,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:36,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:36,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:36,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:36,083 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:36,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:36,099 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:36,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:36,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:36,101 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:36,104 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:36,105 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:36,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:36,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:36,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:36,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:36,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:36,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:36,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:36,145 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:36,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:36,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:36,147 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:36,150 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:36,151 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:36,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:36,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:36,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:36,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:36,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:36,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:36,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:42:36,189 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:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:36,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:36,193 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:36,200 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:36,201 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:36,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:42:36,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:42:36,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:42:36,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:42:36,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:42:36,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:42:36,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:42:36,241 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:42:36,241 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:42:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:42:36,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:42:36,243 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:36,245 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:36,246 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:42:36,278 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:42:36,278 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:42:36,278 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2023-10-12 17:42:36,283 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:36,285 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:42:36,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:36,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:42:36,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:42:36,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:42:36,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:42:36,318 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:36,319 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:36,400 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:36,401 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:36,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2023-10-12 17:42:36,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:42:36,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:36,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:42:36,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:36,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 172 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:42:36,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:42:36,404 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 272 transitions, 1920 flow [2023-10-12 17:42:36,405 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:42:36,405 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 31 places, 272 transitions, 1920 flow [2023-10-12 17:42:36,408 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[][188], 2:2A:[89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][12], 4:3A:[92] L61-1-->L34-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][52], 9:4A:[95] L62-->L46-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][83]][11:5A:[101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[][146]] [2023-10-12 17:42:36,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:42:36,408 INFO L124 PetriNetUnfolderBase]: 4/10 cut-off events. [2023-10-12 17:42:36,408 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:42:36,409 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:42:36,409 INFO L748 eck$LassoCheckResult]: Stem: 39#[$Ultimate##0]true [108] $Ultimate##0-->L61: Formula: (and (= v_i_17 v_l_19) (= v_i_17 v_csum_13) (= v_i_17 v_p_13) (= v_i_17 v_k_22) (= v_asum_17 v_i_17) (<= 0 v_N_27) (= v_i_17 0)) InVars {csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} OutVars{csum=v_csum_13, p=v_p_13, N=v_N_27, l=v_l_19, k=v_k_22, i=v_i_17, asum=v_asum_17} AuxVars[] AssignedVars[] 41#[L61]true [89] L61-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 43#[L23-1, L61-1]true [92] L61-1-->L34-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#[L23-1, L34-1, L62]true [95] L62-->L46-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] 112#[L23-1, L46-1, L63, L34-1]true [2023-10-12 17:42:36,409 INFO L750 eck$LassoCheckResult]: Loop: 112#[L23-1, L46-1, L63, L34-1]true [101] L46-1-->L46-1: Formula: (and (< v_l_17 v_N_13) (<= v_p_9 v_l_17)) InVars {p=v_p_9, N=v_N_13, l=v_l_17} OutVars{p=v_p_9, N=v_N_13, l=v_l_17} AuxVars[] AssignedVars[] 112#[L23-1, L46-1, L63, L34-1]true [2023-10-12 17:42:36,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:36,410 INFO L85 PathProgramCache]: Analyzing trace with hash 4229425, now seen corresponding path program 1 times [2023-10-12 17:42:36,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024538669] [2023-10-12 17:42:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:36,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,415 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:36,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 132, now seen corresponding path program 1 times [2023-10-12 17:42:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:36,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680377427] [2023-10-12 17:42:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:36,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:42:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash 131112276, now seen corresponding path program 1 times [2023-10-12 17:42:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:42:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513563066] [2023-10-12 17:42:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:42:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:42:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:42:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:42:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:42:36,606 INFO L201 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:42:36 BoogieIcfgContainer [2023-10-12 17:42:36,606 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:42:36,608 INFO L158 Benchmark]: Toolchain (without parser) took 2593.70ms. Allocated memory was 201.3MB in the beginning and 292.6MB in the end (delta: 91.2MB). Free memory was 155.3MB in the beginning and 215.5MB in the end (delta: -60.2MB). Peak memory consumption was 31.6MB. Max. memory is 8.0GB. [2023-10-12 17:42:36,608 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. Allocated memory is still 201.3MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:42:36,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.32ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 153.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:36,612 INFO L158 Benchmark]: Boogie Preprocessor took 27.68ms. Allocated memory is still 201.3MB. Free memory was 153.8MB in the beginning and 152.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:36,612 INFO L158 Benchmark]: RCFGBuilder took 244.67ms. Allocated memory is still 201.3MB. Free memory was 152.6MB in the beginning and 142.3MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:42:36,613 INFO L158 Benchmark]: BuchiAutomizer took 2288.01ms. Allocated memory was 201.3MB in the beginning and 292.6MB in the end (delta: 91.2MB). Free memory was 142.1MB in the beginning and 215.5MB in the end (delta: -73.5MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2023-10-12 17:42:36,621 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.76ms. Allocated memory is still 201.3MB. Free memory is still 156.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.32ms. Allocated memory is still 201.3MB. Free memory was 155.3MB in the beginning and 153.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.68ms. Allocated memory is still 201.3MB. Free memory was 153.8MB in the beginning and 152.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.67ms. Allocated memory is still 201.3MB. Free memory was 152.6MB in the beginning and 142.3MB in the end (delta: 10.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2288.01ms. Allocated memory was 201.3MB in the beginning and 292.6MB in the end (delta: 91.2MB). Free memory was 142.1MB in the beginning and 215.5MB in the end (delta: -73.5MB). Peak memory consumption was 18.0MB. 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.1s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. 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, 156 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 142 IncrementalHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 70 mSDtfsCounter, 142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf100 lsp61 ukn80 mio100 lsp83 div100 bol100 ite100 ukn100 eq172 hnf91 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 45]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 45]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L59] 0 assume i == k && i == l && i == p && i == asum && i == csum && i == 0; [L60] 0 assume 0 <= N; VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L61] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L62] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] [L63] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, csum=0, i=0, k=0, l=0, p=0] Loop: [L45] COND TRUE l < N [L46] 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.2s, 32 PlacesBefore, 23 PlacesAfterwards, 26 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, independent: 95, independent conditional: 0, independent unconditional: 95, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 97, unknown conditional: 0, unknown unconditional: 97] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, 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:36,647 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:36,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...