/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/sum-fun.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:40:50,971 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:40:51,031 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:40:51,053 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:40:51,054 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:40:51,054 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:40:51,056 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:40:51,056 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:40:51,056 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:40:51,059 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:40:51,059 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:40:51,059 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:40:51,060 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:40:51,061 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:40:51,061 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:40:51,061 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:40:51,061 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:40:51,062 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:40:51,062 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:40:51,062 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:40:51,062 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:40:51,062 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:40:51,063 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:40:51,063 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:40:51,063 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:40:51,064 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:40:51,064 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:40:51,064 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:40:51,064 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:40:51,064 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:40:51,065 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:40:51,065 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:40:51,065 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:40:51,066 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:40:51,066 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> RABIN_PETRI_NET [2023-10-12 17:40:51,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:40:51,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:40:51,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:40:51,268 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:40:51,273 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:40:51,274 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/sum-fun.wvr.bpl [2023-10-12 17:40:51,274 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-fun.wvr.bpl' [2023-10-12 17:40:51,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:40:51,298 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:40:51,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:51,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:40:51,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:40:51,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,318 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:40:51,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:40:51,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:40:51,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:40:51,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:40:51,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,331 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:40:51,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:40:51,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:40:51,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:40:51,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/1) ... [2023-10-12 17:40:51,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:51,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:51,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:40:51,394 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:40:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:40:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:40:51,394 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:40:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:40:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:40:51,395 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:40:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:40:51,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:40:51,395 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:40:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:40:51,395 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:40:51,395 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:40:51,431 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:40:51,432 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:40:51,504 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:40:51,517 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:40:51,517 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:40:51,518 INFO L201 PluginConnector]: Adding new model sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:51 BoogieIcfgContainer [2023-10-12 17:40:51,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:40:51,519 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:40:51,519 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:40:51,522 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:40:51,529 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:51,529 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:40:51" (1/2) ... [2023-10-12 17:40:51,530 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@407ab824 and model type sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:40:51, skipping insertion in model container [2023-10-12 17:40:51,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:40:51,531 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:40:51" (2/2) ... [2023-10-12 17:40:51,532 INFO L332 chiAutomizerObserver]: Analyzing ICFG sum-fun.wvr.bpl [2023-10-12 17:40:51,582 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:40:51,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:51,617 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:51,617 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:51,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:51,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:40:51,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:51,627 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:40:51,636 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:51,638 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:51,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:40:51,644 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:40:51,645 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:40:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:40:51,645 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:40:51,928 INFO L134 LiptonReduction]: Checked pairs total: 124 [2023-10-12 17:40:51,929 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:40:51,939 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:40:51,939 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:40:51,940 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:40:51,940 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:40:51,940 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:40:51,940 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:40:51,940 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:40:51,940 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:40:51,941 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:51,944 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][14], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_sum1_12) v_sum1_11) (< v_i_16 v_N_10)) InVars {sum1=v_sum1_12, A=v_A_12, N=v_N_10, i=v_i_16} OutVars{sum1=v_sum1_11, A=v_A_12, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[sum1, i][10]] [2023-10-12 17:40:51,947 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:51,948 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:51,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:51,949 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:51,951 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:40:51,952 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:40:51,953 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][14], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0]][3:3A:[96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_sum1_12) v_sum1_11) (< v_i_16 v_N_10)) InVars {sum1=v_sum1_12, A=v_A_12, N=v_N_10, i=v_i_16} OutVars{sum1=v_sum1_11, A=v_A_12, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[sum1, i][10]] [2023-10-12 17:40:51,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:51,954 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:40:51,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:51,954 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:51,957 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [2023-10-12 17:40:51,961 INFO L750 eck$LassoCheckResult]: Loop: 44#[L23-1, L59-1]true [96] L23-1-->L23-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= (+ (select v_A_12 v_i_16) v_sum1_12) v_sum1_11) (< v_i_16 v_N_10)) InVars {sum1=v_sum1_12, A=v_A_12, N=v_N_10, i=v_i_16} OutVars{sum1=v_sum1_11, A=v_A_12, N=v_N_10, i=v_i_15} AuxVars[] AssignedVars[sum1, i] 44#[L23-1, L59-1]true [2023-10-12 17:40:51,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:40:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436679593] [2023-10-12 17:40:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 127, now seen corresponding path program 1 times [2023-10-12 17:40:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307628625] [2023-10-12 17:40:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,088 INFO L85 PathProgramCache]: Analyzing trace with hash 130420, now seen corresponding path program 1 times [2023-10-12 17:40:52,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453930688] [2023-10-12 17:40:52,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,176 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:52,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:52,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:52,177 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:52,177 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:52,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:52,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:52,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:52,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-fun.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:40:52,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:52,177 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:52,186 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,209 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,212 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,216 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,286 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:52,289 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:52,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:52,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:52,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:52,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:52,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:52,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:52,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:52,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:52,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:52,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:40:52,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:52,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:52,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:52,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:52,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:52,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:40:52,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:52,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:52,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:52,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:52,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:52,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:52,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:52,364 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:52,375 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:40:52,375 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:40:52,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:52,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:52,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:52,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:40:52,385 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:52,392 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:52,392 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:52,393 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:40:52,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:52,400 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:52,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:52,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:52,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:52,452 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:52,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:52,487 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:52,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:40:52,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:52,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:52,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:52,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:40:52,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:52,571 INFO L430 stractBuchiCegarLoop]: Abstraction has has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:52,571 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:40:52,571 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 26 places, 60 transitions, 312 flow [2023-10-12 17:40:52,572 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][56], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][0], 4:3A:[84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][14]][5:4A:[94] L34-1-->L34-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (+ (select v_A_10 v_j_16) v_sum2_12) v_sum2_11) (< v_j_16 v_M_10)) InVars {A=v_A_10, sum2=v_sum2_12, M=v_M_10, j=v_j_16} OutVars{A=v_A_10, sum2=v_sum2_11, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[sum2, j][51]] [2023-10-12 17:40:52,572 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:52,572 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-10-12 17:40:52,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:40:52,572 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:52,573 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 79#[L23-1, L60, L34-1]true [2023-10-12 17:40:52,573 INFO L750 eck$LassoCheckResult]: Loop: 79#[L23-1, L60, L34-1]true [94] L34-1-->L34-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (+ (select v_A_10 v_j_16) v_sum2_12) v_sum2_11) (< v_j_16 v_M_10)) InVars {A=v_A_10, sum2=v_sum2_12, M=v_M_10, j=v_j_16} OutVars{A=v_A_10, sum2=v_sum2_11, M=v_M_10, j=v_j_15} AuxVars[] AssignedVars[sum2, j] 79#[L23-1, L60, L34-1]true [2023-10-12 17:40:52,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:40:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618686408] [2023-10-12 17:40:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,578 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 125, now seen corresponding path program 1 times [2023-10-12 17:40:52,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919721886] [2023-10-12 17:40:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash 4042742, now seen corresponding path program 1 times [2023-10-12 17:40:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554373161] [2023-10-12 17:40:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,674 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:52,674 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:52,674 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:52,674 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:52,674 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:52,674 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:52,675 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:52,675 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:52,675 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-fun.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:40:52,675 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:52,675 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:52,676 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,688 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,690 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,692 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,694 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,697 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,700 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:52,762 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:52,763 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:52,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:52,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:52,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:52,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:40:52,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:52,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:52,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:52,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:52,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:52,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:52,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:52,832 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:52,843 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:40:52,843 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:40:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:52,845 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:52,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:40:52,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:52,868 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:52,869 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:52,869 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:40:52,877 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:40:52,878 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:52,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:52,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:52,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:52,909 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:52,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:52,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:52,910 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:40:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:52,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:40:52,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:52,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:52,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:52,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:40:52,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:52,979 INFO L430 stractBuchiCegarLoop]: Abstraction has has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:52,979 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:40:52,979 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 30 places, 240 transitions, 1728 flow [2023-10-12 17:40:52,981 ERROR L47 etriNetUnfolderRabin]: [1:1A:[102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[][225], 2:2A:[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][1], 4:3A:[84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1][57], 7:4A:[87] L60-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0][95]][8:5A:[99] L45-1-->L45-1: Formula: (and (= v_k_13 (+ v_k_14 1)) (= (+ (select v_A_14 v_k_14) v_sum3_14) v_sum3_13) (< v_k_14 v_N_14)) InVars {A=v_A_14, sum3=v_sum3_14, N=v_N_14, k=v_k_14} OutVars{A=v_A_14, sum3=v_sum3_13, N=v_N_14, k=v_k_13} AuxVars[] AssignedVars[sum3, k][110]] [2023-10-12 17:40:52,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:40:52,981 INFO L124 PetriNetUnfolderBase]: 2/7 cut-off events. [2023-10-12 17:40:52,981 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-10-12 17:40:52,981 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:40:52,981 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L59: Formula: (and (= v_i_21 v_j_21) (= v_i_21 v_sum2_21) (<= 0 v_M_14) (= v_i_21 v_sum3_21) (= v_M_14 v_k_17) (= v_i_21 v_sum1_21) (< v_M_14 v_N_18) (= v_i_21 0)) InVars {sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} OutVars{sum1=v_sum1_21, sum2=v_sum2_21, sum3=v_sum3_21, N=v_N_18, M=v_M_14, k=v_k_17, j=v_j_21, i=v_i_21} AuxVars[] AssignedVars[] 42#[L59]true [81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L23-1, L59-1]true [84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 79#[L23-1, L60, L34-1]true [87] L60-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 113#[L23-1, L61, L34-1, L45-1]true [2023-10-12 17:40:52,982 INFO L750 eck$LassoCheckResult]: Loop: 113#[L23-1, L61, L34-1, L45-1]true [99] L45-1-->L45-1: Formula: (and (= v_k_13 (+ v_k_14 1)) (= (+ (select v_A_14 v_k_14) v_sum3_14) v_sum3_13) (< v_k_14 v_N_14)) InVars {A=v_A_14, sum3=v_sum3_14, N=v_N_14, k=v_k_14} OutVars{A=v_A_14, sum3=v_sum3_13, N=v_N_14, k=v_k_13} AuxVars[] AssignedVars[sum3, k] 113#[L23-1, L61, L34-1, L45-1]true [2023-10-12 17:40:52,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash 4042735, now seen corresponding path program 1 times [2023-10-12 17:40:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068913012] [2023-10-12 17:40:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,986 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:40:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67934022] [2023-10-12 17:40:52,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:52,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:52,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:52,995 INFO L85 PathProgramCache]: Analyzing trace with hash 125324884, now seen corresponding path program 1 times [2023-10-12 17:40:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:40:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458899551] [2023-10-12 17:40:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:40:52,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:40:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:53,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:40:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:40:53,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:53,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:40:53,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:53,130 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:40:53,130 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:40:53,130 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:40:53,130 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:40:53,130 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:40:53,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:53,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:40:53,131 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:40:53,131 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum-fun.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:40:53,131 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:40:53,131 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:40:53,133 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,135 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,147 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,153 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,155 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,162 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,164 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,166 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:40:53,261 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:40:53,261 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:40:53,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:53,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:53,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:53,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:40:53,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:53,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:53,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:53,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:53,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:53,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:53,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:53,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:53,296 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:40:53,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:53,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:53,456 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:53,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:40:53,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:53,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:53,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:53,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:53,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:53,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:53,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:53,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:53,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:40:53,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:53,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:53,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:53,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:53,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:53,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:53,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:53,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:53,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:53,501 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:53,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:40:53,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:40:53,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:53,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:53,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:53,570 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:53,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:40:53,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:40:53,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:40:53,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:40:53,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:40:53,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:40:53,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:40:53,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:40:53,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:40:53,611 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:40:53,611 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:40:53,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:40:53,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:40:53,612 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:40:53,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:40:53,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:40:53,653 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:40:53,653 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:40:53,653 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:40:53,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:53,664 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:40:53,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:40:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:53,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:40:53,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:40:53,688 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:40:53,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:40:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:40:53,689 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:40:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:40:53,741 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:40:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:40:53,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:40:53,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:53,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:40:53,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:53,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:40:53,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:40:53,742 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:53,743 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:40:53,743 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 960 transitions, 8832 flow [2023-10-12 17:40:53,767 INFO L124 PetriNetUnfolderBase]: 90/133 cut-off events. [2023-10-12 17:40:53,768 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-10-12 17:40:53,768 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:40:53,772 INFO L201 PluginConnector]: Adding new model sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:40:53 BoogieIcfgContainer [2023-10-12 17:40:53,772 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:40:53,773 INFO L158 Benchmark]: Toolchain (without parser) took 2474.53ms. Allocated memory was 177.2MB in the beginning and 290.5MB in the end (delta: 113.2MB). Free memory was 129.2MB in the beginning and 210.1MB in the end (delta: -81.0MB). Peak memory consumption was 33.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:53,773 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 177.2MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:40:53,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.52ms. Allocated memory is still 177.2MB. Free memory was 129.2MB in the beginning and 127.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:40:53,773 INFO L158 Benchmark]: Boogie Preprocessor took 16.29ms. Allocated memory is still 177.2MB. Free memory was 127.4MB in the beginning and 126.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:40:53,774 INFO L158 Benchmark]: RCFGBuilder took 180.88ms. Allocated memory is still 177.2MB. Free memory was 126.3MB in the beginning and 116.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:40:53,774 INFO L158 Benchmark]: BuchiAutomizer took 2252.75ms. Allocated memory was 177.2MB in the beginning and 290.5MB in the end (delta: 113.2MB). Free memory was 116.3MB in the beginning and 210.1MB in the end (delta: -93.9MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2023-10-12 17:40:53,775 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.21ms. Allocated memory is still 177.2MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.52ms. Allocated memory is still 177.2MB. Free memory was 129.2MB in the beginning and 127.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.29ms. Allocated memory is still 177.2MB. Free memory was 127.4MB in the beginning and 126.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 180.88ms. Allocated memory is still 177.2MB. Free memory was 126.3MB in the beginning and 116.6MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2252.75ms. Allocated memory was 177.2MB in the beginning and 290.5MB in the end (delta: 113.2MB). Free memory was 116.3MB in the beginning and 210.1MB in the end (delta: -93.9MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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.1s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. 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, 240 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 204 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 114 mSDtfsCounter, 204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital51 mio100 ax100 hnf100 lsp61 ukn93 mio100 lsp72 div100 bol100 ite100 ukn100 eq159 hnf92 smp100 dnf100 smp100 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TerminationAnalysisResult: 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, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 124, independent conditional: 0, independent unconditional: 124, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , 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:40:53,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:40:53,997 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...