/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:59,357 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:59,419 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:38:59,440 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:59,440 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:59,441 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:59,441 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:59,442 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:59,442 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:59,445 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:59,445 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:59,445 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:59,445 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:59,446 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:59,447 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:59,447 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:59,447 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:59,447 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:59,447 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:59,447 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:59,448 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:59,448 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:59,448 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:59,448 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:59,448 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:59,448 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:59,449 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:59,449 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:59,449 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:59,449 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:59,450 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:59,450 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:59,450 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:59,451 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:59,451 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:38:59,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:59,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:59,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:59,648 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:59,648 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:59,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum-alt.wvr.bpl [2023-10-12 17:38:59,649 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/array-sum-alt.wvr.bpl' [2023-10-12 17:38:59,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:59,665 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:59,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:59,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:59,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:59,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,682 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:59,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:59,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:59,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:59,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:59,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:59,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:59,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:59,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:59,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/1) ... [2023-10-12 17:38:59,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:59,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:59,715 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:38:59,744 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:38:59,752 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:59,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:59,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:59,753 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:59,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:59,753 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:59,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:59,753 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:59,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:59,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:59,754 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:38:59,787 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:59,789 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:59,877 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:59,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:59,881 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:38:59,890 INFO L201 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:59 BoogieIcfgContainer [2023-10-12 17:38:59,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:59,891 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:59,891 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:59,902 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:59,902 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:59,903 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:59" (1/2) ... [2023-10-12 17:38:59,905 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15f8dbdd and model type array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:59, skipping insertion in model container [2023-10-12 17:38:59,905 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:59,905 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:59" (2/2) ... [2023-10-12 17:38:59,906 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-alt.wvr.bpl [2023-10-12 17:38:59,959 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:59,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:39:00,006 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:39:00,006 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:39:00,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:39:00,009 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 35 transitions, 94 flow [2023-10-12 17:39:00,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:00,015 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:39:00,024 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:00,031 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:00,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 76 flow [2023-10-12 17:39:00,045 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-10-12 17:39:00,045 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:39:00,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:39:00,046 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:39:00,319 INFO L134 LiptonReduction]: Checked pairs total: 138 [2023-10-12 17:39:00,319 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:39:00,328 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:39:00,328 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:39:00,328 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:39:00,328 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:39:00,329 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:39:00,329 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:39:00,329 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:39:00,329 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:39:00,329 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:39:00,331 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L52: Formula: (and (= v_i_19 v_res1_19) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_res2_41) (= v_i_19 v_j_25) (= v_M_14 v_k_21) (<= v_M_14 v_N_20)) InVars {N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} OutVars{N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} AuxVars[] AssignedVars[][12], 2:2A:[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[104] L21-->L21: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_res1_14) v_res1_13) (< v_i_16 v_N_14)) InVars {A=v_A_12, N=v_N_14, res1=v_res1_14, i=v_i_16} OutVars{A=v_A_12, N=v_N_14, res1=v_res1_13, i=v_i_15} AuxVars[] AssignedVars[res1, i][14]] [2023-10-12 17:39:00,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:00,333 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:39:00,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:00,333 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:00,335 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:39:00,335 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:39:00,336 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L52: Formula: (and (= v_i_19 v_res1_19) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_res2_41) (= v_i_19 v_j_25) (= v_M_14 v_k_21) (<= v_M_14 v_N_20)) InVars {N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} OutVars{N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} AuxVars[] AssignedVars[][12], 2:2A:[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][3]][3:3A:[104] L21-->L21: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_res1_14) v_res1_13) (< v_i_16 v_N_14)) InVars {A=v_A_12, N=v_N_14, res1=v_res1_14, i=v_i_16} OutVars{A=v_A_12, N=v_N_14, res1=v_res1_13, i=v_i_15} AuxVars[] AssignedVars[res1, i][14]] [2023-10-12 17:39:00,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:00,336 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:39:00,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:00,336 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:00,339 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [108] $Ultimate##0-->L52: Formula: (and (= v_i_19 v_res1_19) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_res2_41) (= v_i_19 v_j_25) (= v_M_14 v_k_21) (<= v_M_14 v_N_20)) InVars {N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} OutVars{N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} AuxVars[] AssignedVars[] 45#[L52]true [84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L21, L52-1]true [2023-10-12 17:39:00,340 INFO L750 eck$LassoCheckResult]: Loop: 47#[L21, L52-1]true [104] L21-->L21: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_res1_14) v_res1_13) (< v_i_16 v_N_14)) InVars {A=v_A_12, N=v_N_14, res1=v_res1_14, i=v_i_16} OutVars{A=v_A_12, N=v_N_14, res1=v_res1_13, i=v_i_15} AuxVars[] AssignedVars[res1, i] 47#[L21, L52-1]true [2023-10-12 17:39:00,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:00,343 INFO L85 PathProgramCache]: Analyzing trace with hash 4393, now seen corresponding path program 1 times [2023-10-12 17:39:00,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:00,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336730321] [2023-10-12 17:39:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:00,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:00,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:00,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 135, now seen corresponding path program 1 times [2023-10-12 17:39:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968810203] [2023-10-12 17:39:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:00,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:00,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:00,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:00,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 136287, now seen corresponding path program 1 times [2023-10-12 17:39:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:00,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604839490] [2023-10-12 17:39:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:00,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:00,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:00,553 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:00,554 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:00,554 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:00,554 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:00,554 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:00,554 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:00,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:00,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:00,555 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:39:00,555 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:00,555 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:00,566 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:39:00,575 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:39:00,578 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:39:00,581 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:39:00,666 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:00,668 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:00,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:00,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:00,673 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:39:00,679 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:39:00,685 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:39:00,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:00,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:00,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:00,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:00,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:00,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:00,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:00,729 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:39:00,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:00,734 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:39:00,737 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:39:00,737 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:39:00,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:00,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:00,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:00,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:00,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:00,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:00,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:00,775 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:39:00,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:00,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:00,776 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:39:00,777 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:39:00,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:39:00,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:00,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:00,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:00,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:00,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:00,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:00,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:00,802 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:39:00,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:00,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:00,803 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:39:00,805 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:39:00,849 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:39:00,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:00,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:00,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:00,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:00,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:00,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:00,880 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:00,903 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:39:00,903 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:39:00,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:00,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:00,906 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:39:00,908 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:39:00,941 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:00,954 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:00,954 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:00,955 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:39:00,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:39:00,960 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:00,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:00,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:00,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:01,005 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:01,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:01,005 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:39:01,025 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:39:01,114 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:39:01,119 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:39:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:39:01,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:39:01,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:39:01,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:39:01,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,126 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 60 transitions, 312 flow [2023-10-12 17:39:01,127 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:39:01,127 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 60 transitions, 312 flow [2023-10-12 17:39:01,129 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L52: Formula: (and (= v_i_19 v_res1_19) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_res2_41) (= v_i_19 v_j_25) (= v_M_14 v_k_21) (<= v_M_14 v_N_20)) InVars {N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} OutVars{N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} AuxVars[] AssignedVars[][51], 2:2A:[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][15], 4:3A:[87] L52-1-->L30: 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][18]][5:4A:[105] L30-->L30: Formula: (and (= v_res2_25 (+ v_res2_26 (select v_A_14 v_j_18))) (< v_j_18 v_M_12) (= (+ v_j_18 1) v_j_17)) InVars {A=v_A_14, M=v_M_12, j=v_j_18, res2=v_res2_26} OutVars{A=v_A_14, M=v_M_12, j=v_j_17, res2=v_res2_25} AuxVars[] AssignedVars[j, res2][52]] [2023-10-12 17:39:01,130 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:01,130 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:39:01,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:39:01,130 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:01,130 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [108] $Ultimate##0-->L52: Formula: (and (= v_i_19 v_res1_19) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_res2_41) (= v_i_19 v_j_25) (= v_M_14 v_k_21) (<= v_M_14 v_N_20)) InVars {N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} OutVars{N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} AuxVars[] AssignedVars[] 45#[L52]true [84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L21, L52-1]true [87] L52-1-->L30: 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] 82#[L21, L30, L53]true [2023-10-12 17:39:01,130 INFO L750 eck$LassoCheckResult]: Loop: 82#[L21, L30, L53]true [105] L30-->L30: Formula: (and (= v_res2_25 (+ v_res2_26 (select v_A_14 v_j_18))) (< v_j_18 v_M_12) (= (+ v_j_18 1) v_j_17)) InVars {A=v_A_14, M=v_M_12, j=v_j_18, res2=v_res2_26} OutVars{A=v_A_14, M=v_M_12, j=v_j_17, res2=v_res2_25} AuxVars[] AssignedVars[j, res2] 82#[L21, L30, L53]true [2023-10-12 17:39:01,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash 136270, now seen corresponding path program 1 times [2023-10-12 17:39:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316839204] [2023-10-12 17:39:01,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash 136, now seen corresponding path program 1 times [2023-10-12 17:39:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130578292] [2023-10-12 17:39:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 4224475, now seen corresponding path program 1 times [2023-10-12 17:39:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832234071] [2023-10-12 17:39:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,243 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:01,243 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:01,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:01,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:01,244 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:01,244 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,244 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:01,244 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:01,244 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:39:01,244 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:01,244 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:01,246 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:01,249 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:01,252 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:39:01,265 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:39:01,268 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:39:01,271 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:01,339 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:01,339 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:01,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,341 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:39:01,349 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:39:01,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:01,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:01,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:01,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:01,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:01,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:01,364 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:39:01,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:01,379 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:39:01,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,381 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:39:01,383 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:39:01,385 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:39:01,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:01,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:01,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:01,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:01,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:01,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:01,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:01,412 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:39:01,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,414 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:39:01,417 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:39:01,419 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:39:01,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:01,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:01,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:01,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:01,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:01,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:01,447 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:01,469 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:39:01,469 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:39:01,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,472 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:39:01,473 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:39:01,474 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:01,495 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:01,496 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:01,496 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:39:01,507 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:39:01,508 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:01,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:01,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:01,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:01,540 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:01,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:01,540 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:39:01,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:39:01,624 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:39:01,625 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:39:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:39:01,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:39:01,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:39:01,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:39:01,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:01,628 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 240 transitions, 1728 flow [2023-10-12 17:39:01,629 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:39:01,629 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 240 transitions, 1728 flow [2023-10-12 17:39:01,633 ERROR L47 etriNetUnfolderRabin]: [1:1A:[108] $Ultimate##0-->L52: Formula: (and (= v_i_19 v_res1_19) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_res2_41) (= v_i_19 v_j_25) (= v_M_14 v_k_21) (<= v_M_14 v_N_20)) InVars {N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} OutVars{N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} AuxVars[] AssignedVars[][207], 2:2A:[84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][63], 4:3A:[87] L52-1-->L30: 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][75], 9:4A:[90] L53-->L39: 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][81]][10:5A:[107] L39-->L39: Formula: (and (= (+ (select v_A_18 v_k_18) v_res2_38) v_res2_37) (< v_k_18 v_N_18) (= v_k_17 (+ v_k_18 1))) InVars {A=v_A_18, N=v_N_18, k=v_k_18, res2=v_res2_38} OutVars{A=v_A_18, N=v_N_18, k=v_k_17, res2=v_res2_37} AuxVars[] AssignedVars[k, res2][178]] [2023-10-12 17:39:01,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:39:01,633 INFO L124 PetriNetUnfolderBase]: 3/9 cut-off events. [2023-10-12 17:39:01,633 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:39:01,633 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:39:01,634 INFO L748 eck$LassoCheckResult]: Stem: 43#[$Ultimate##0]true [108] $Ultimate##0-->L52: Formula: (and (= v_i_19 v_res1_19) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_res2_41) (= v_i_19 v_j_25) (= v_M_14 v_k_21) (<= v_M_14 v_N_20)) InVars {N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} OutVars{N=v_N_20, M=v_M_14, k=v_k_21, res1=v_res1_19, j=v_j_25, i=v_i_19, res2=v_res2_41} AuxVars[] AssignedVars[] 45#[L52]true [84] L52-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 47#[L21, L52-1]true [87] L52-1-->L30: 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] 82#[L21, L30, L53]true [90] L53-->L39: 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] 116#[L54, L39, L21, L30]true [2023-10-12 17:39:01,634 INFO L750 eck$LassoCheckResult]: Loop: 116#[L54, L39, L21, L30]true [107] L39-->L39: Formula: (and (= (+ (select v_A_18 v_k_18) v_res2_38) v_res2_37) (< v_k_18 v_N_18) (= v_k_17 (+ v_k_18 1))) InVars {A=v_A_18, N=v_N_18, k=v_k_18, res2=v_res2_38} OutVars{A=v_A_18, N=v_N_18, k=v_k_17, res2=v_res2_37} AuxVars[] AssignedVars[k, res2] 116#[L54, L39, L21, L30]true [2023-10-12 17:39:01,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash 4224460, now seen corresponding path program 1 times [2023-10-12 17:39:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587593870] [2023-10-12 17:39:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 138, now seen corresponding path program 1 times [2023-10-12 17:39:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924988151] [2023-10-12 17:39:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 130958367, now seen corresponding path program 1 times [2023-10-12 17:39:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:39:01,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72714989] [2023-10-12 17:39:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:39:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:39:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:39:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:39:01,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:39:01,764 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:39:01,764 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:39:01,764 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:39:01,764 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:39:01,764 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:39:01,764 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,764 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:39:01,764 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:39:01,764 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-alt.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:39:01,764 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:39:01,764 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:39:01,766 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:39:01,770 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:39:01,772 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:39:01,774 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:39:01,784 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:39:01,787 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:39:01,789 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:39:01,790 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:39:01,793 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:39:01,795 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:39:01,850 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:39:01,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:39:01,910 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:39:01,911 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:39:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,912 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:39:01,919 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:39:01,919 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:39:01,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:01,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:01,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:01,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:01,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:01,926 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:01,945 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:01,949 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:39:01,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,951 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:39:01,953 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:39:01,954 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:39:01,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:01,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:01,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:01,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:01,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:01,963 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:01,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:01,983 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:39:01,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:01,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:01,985 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:39:01,999 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:39:02,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:39:02,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:02,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:02,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:39:02,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:39:02,032 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:39:02,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,062 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:39:02,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:39:02,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,073 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:39:02,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:39:02,077 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:39:02,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:39:02,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:39:02,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:39:02,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:39:02,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:39:02,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:39:02,113 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:39:02,119 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:39:02,119 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:39:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:39:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:39:02,120 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:39:02,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:39:02,124 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:39:02,146 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:39:02,146 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:39:02,146 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:39:02,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:02,151 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:39:02,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:39:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:02,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:39:02,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:39:02,174 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:39:02,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:39:02,175 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:39:02,175 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:39:02,237 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:39:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:39:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2023-10-12 17:39:02,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:39:02,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:39:02,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 200 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:39:02,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:39:02,239 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 960 transitions, 8832 flow [2023-10-12 17:39:02,239 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:39:02,239 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 960 transitions, 8832 flow [2023-10-12 17:39:02,264 INFO L124 PetriNetUnfolderBase]: 90/133 cut-off events. [2023-10-12 17:39:02,265 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-10-12 17:39:02,265 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:39:02,269 INFO L201 PluginConnector]: Adding new model array-sum-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:39:02 BoogieIcfgContainer [2023-10-12 17:39:02,269 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:39:02,270 INFO L158 Benchmark]: Toolchain (without parser) took 2604.61ms. Allocated memory was 207.6MB in the beginning and 251.7MB in the end (delta: 44.0MB). Free memory was 157.2MB in the beginning and 185.2MB in the end (delta: -28.0MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2023-10-12 17:39:02,270 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 207.6MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:39:02,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.91ms. Allocated memory is still 207.6MB. Free memory was 157.2MB in the beginning and 155.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:39:02,271 INFO L158 Benchmark]: Boogie Preprocessor took 11.85ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 154.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:39:02,271 INFO L158 Benchmark]: RCFGBuilder took 194.47ms. Allocated memory is still 207.6MB. Free memory was 154.6MB in the beginning and 176.6MB in the end (delta: -22.1MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2023-10-12 17:39:02,271 INFO L158 Benchmark]: BuchiAutomizer took 2378.24ms. Allocated memory was 207.6MB in the beginning and 251.7MB in the end (delta: 44.0MB). Free memory was 176.6MB in the beginning and 185.2MB in the end (delta: -8.6MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. [2023-10-12 17:39:02,272 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.19ms. Allocated memory is still 207.6MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 16.91ms. Allocated memory is still 207.6MB. Free memory was 157.2MB in the beginning and 155.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 11.85ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 154.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 194.47ms. Allocated memory is still 207.6MB. Free memory was 154.6MB in the beginning and 176.6MB in the end (delta: -22.1MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 2378.24ms. Allocated memory was 207.6MB in the beginning and 251.7MB in the end (delta: 44.0MB). Free memory was 176.6MB in the beginning and 185.2MB in the end (delta: -8.6MB). Peak memory consumption was 34.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.5s. Construction of modules took 0.1s. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 274 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 216 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 144 mSDtfsCounter, 216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital48 mio100 ax100 hnf100 lsp65 ukn93 mio100 lsp72 div100 bol100 ite100 ukn100 eq159 hnf92 smp100 dnf100 smp100 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms 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.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 22 PlacesAfterwards, 29 TransitionsBefore, 15 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 138, independent conditional: 0, independent unconditional: 138, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 120, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 120, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 120, unknown conditional: 0, unknown unconditional: 120] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:39:02,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:39:02,495 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...