/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/chl/word-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:21,586 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:21,623 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:21,647 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:21,648 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:21,648 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:21,649 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:21,649 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:21,649 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:21,649 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:21,650 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:21,650 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:21,650 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:21,650 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:21,651 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:21,651 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:21,651 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:21,651 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:21,651 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:21,652 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:21,652 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:21,652 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:21,654 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:21,654 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:21,654 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:21,654 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:21,654 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:21,654 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:21,655 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:21,655 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:21,655 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:21,655 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:21,655 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:21,656 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:21,656 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:21,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:21,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:21,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:21,849 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:21,850 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:21,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-trans.wvr.bpl [2023-10-12 17:38:21,851 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-trans.wvr.bpl' [2023-10-12 17:38:21,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:21,872 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:21,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:21,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:21,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:21,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,889 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:21,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:21,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:21,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:21,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:21,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,902 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:21,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:21,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:21,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:21,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/1) ... [2023-10-12 17:38:21,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,939 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:21,971 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:21,988 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:21,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:21,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:21,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:21,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:21,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:21,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:21,989 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:21,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:21,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:21,990 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:22,028 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:22,030 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:22,133 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:22,169 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:22,169 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:38:22,171 INFO L201 PluginConnector]: Adding new model word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:22 BoogieIcfgContainer [2023-10-12 17:38:22,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:22,172 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:22,172 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:22,177 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:22,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:22,177 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:21" (1/2) ... [2023-10-12 17:38:22,178 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68eccdf5 and model type word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:22, skipping insertion in model container [2023-10-12 17:38:22,178 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:22,179 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:22" (2/2) ... [2023-10-12 17:38:22,180 INFO L332 chiAutomizerObserver]: Analyzing ICFG word-trans.wvr.bpl [2023-10-12 17:38:22,288 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:22,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:38:22,323 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:38:22,324 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:22,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:38:22,327 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:38:22,330 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:22,332 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:22,341 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:22,343 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:22,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:22,354 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:38:22,355 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:38:22,356 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:38:22,585 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:38:22,585 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:38:22,596 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:22,596 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:22,596 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:22,596 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:22,596 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:22,596 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:22,597 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:22,597 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:22,597 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:38:22,600 ERROR L47 etriNetUnfolderRabin]: [1:1A:[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][11], 2:2A:[117] $Ultimate##0-->L38: Formula: (and (not v_break_10_13) (= v_i_9_16 0) (= v_count_1_15 v_count_4_11)) InVars {count_4=v_count_4_11, count_1=v_count_1_15} OutVars{break_10=v_break_10_13, count_1=v_count_1_15, count_4=v_count_4_11, i_9=v_i_9_16} AuxVars[] AssignedVars[break_10, i_9][1]][3:3A:[120] L38-->L38: Formula: (let ((.cse1 (not v_break_10_18)) (.cse2 (select v_array_3_15 v_i_9_21)) (.cse3 (select v_array_0_15 v_i_9_21))) (and (< v_i_9_21 v_len_2_15) (let ((.cse0 (= .cse2 .cse3))) (or (and (not v_break_10_17) .cse0 .cse1) (and v_break_10_17 (or v_break_10_18 (not .cse0))))) (< v_i_9_21 v_len_5_17) .cse1 (= v_result_11_17 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_11_18))) (= (+ v_i_9_21 1) v_i_9_20))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_17, i_9=v_i_9_21} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_17, i_9=v_i_9_20} AuxVars[] AssignedVars[break_10, result_11, i_9][7]] [2023-10-12 17:38:22,601 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:22,601 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:22,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:22,602 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:22,605 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:22,606 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:38:22,606 ERROR L47 etriNetUnfolderRabin]: [1:1A:[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][11], 2:2A:[117] $Ultimate##0-->L38: Formula: (and (not v_break_10_13) (= v_i_9_16 0) (= v_count_1_15 v_count_4_11)) InVars {count_4=v_count_4_11, count_1=v_count_1_15} OutVars{break_10=v_break_10_13, count_1=v_count_1_15, count_4=v_count_4_11, i_9=v_i_9_16} AuxVars[] AssignedVars[break_10, i_9][1]][3:3A:[120] L38-->L38: Formula: (let ((.cse1 (not v_break_10_18)) (.cse2 (select v_array_3_15 v_i_9_21)) (.cse3 (select v_array_0_15 v_i_9_21))) (and (< v_i_9_21 v_len_2_15) (let ((.cse0 (= .cse2 .cse3))) (or (and (not v_break_10_17) .cse0 .cse1) (and v_break_10_17 (or v_break_10_18 (not .cse0))))) (< v_i_9_21 v_len_5_17) .cse1 (= v_result_11_17 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_11_18))) (= (+ v_i_9_21 1) v_i_9_20))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_17, i_9=v_i_9_21} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_17, i_9=v_i_9_20} AuxVars[] AssignedVars[break_10, result_11, i_9][7]] [2023-10-12 17:38:22,607 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:22,607 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:22,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:22,607 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:22,610 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[L121, $Ultimate##0]true [117] $Ultimate##0-->L38: Formula: (and (not v_break_10_13) (= v_i_9_16 0) (= v_count_1_15 v_count_4_11)) InVars {count_4=v_count_4_11, count_1=v_count_1_15} OutVars{break_10=v_break_10_13, count_1=v_count_1_15, count_4=v_count_4_11, i_9=v_i_9_16} AuxVars[] AssignedVars[break_10, i_9] 40#[L121, L38]true [2023-10-12 17:38:22,610 INFO L750 eck$LassoCheckResult]: Loop: 40#[L121, L38]true [120] L38-->L38: Formula: (let ((.cse1 (not v_break_10_18)) (.cse2 (select v_array_3_15 v_i_9_21)) (.cse3 (select v_array_0_15 v_i_9_21))) (and (< v_i_9_21 v_len_2_15) (let ((.cse0 (= .cse2 .cse3))) (or (and (not v_break_10_17) .cse0 .cse1) (and v_break_10_17 (or v_break_10_18 (not .cse0))))) (< v_i_9_21 v_len_5_17) .cse1 (= v_result_11_17 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_11_18))) (= (+ v_i_9_21 1) v_i_9_20))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_17, i_9=v_i_9_21} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_17, i_9=v_i_9_20} AuxVars[] AssignedVars[break_10, result_11, i_9] 40#[L121, L38]true [2023-10-12 17:38:22,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash 5201, now seen corresponding path program 1 times [2023-10-12 17:38:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109771280] [2023-10-12 17:38:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,751 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2023-10-12 17:38:22,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587387929] [2023-10-12 17:38:22,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash 161351, now seen corresponding path program 1 times [2023-10-12 17:38:22,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612903564] [2023-10-12 17:38:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,777 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,937 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:22,937 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:22,938 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:22,938 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:22,938 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:22,938 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,938 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:22,938 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:22,938 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-trans.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:22,938 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:22,938 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:22,952 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:38:22,961 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:38:22,964 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:38:23,208 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:23,211 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:23,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:23,214 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:38:23,222 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:38:23,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:23,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:23,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:23,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:23,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:23,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:23,237 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:38:23,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:23,262 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:38:23,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:23,264 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:38:23,266 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:38:23,267 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:38:23,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:23,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:23,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:23,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:23,277 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:23,277 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:23,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:23,297 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:38:23,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:23,298 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:38:23,322 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:38:23,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:23,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:23,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:23,329 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:38:23,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:23,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:23,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:23,353 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:23,360 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:23,360 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:23,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:23,364 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:38:23,365 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:38:23,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:23,374 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:23,375 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:23,375 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_2, i_9) = 1*len_2 - 1*i_9 Supporting invariants [] [2023-10-12 17:38:23,378 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:38:23,381 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:23,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:23,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:23,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:23,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:23,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:23,430 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:38:23,462 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:38:23,550 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:38:23,556 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:38:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:23,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:23,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:23,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:23,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:23,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:23,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:23,564 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 100 transitions, 490 flow [2023-10-12 17:38:23,566 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:23,566 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 100 transitions, 490 flow [2023-10-12 17:38:23,576 ERROR L47 etriNetUnfolderRabin]: [1:1A:[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][59], 4:2A:[136] L121-->$Ultimate##0: 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][49], 18:3A:[122] $Ultimate##0-->L68: Formula: (and (= v_count_7_13 v_count_4_15) (not v_break_13_21) (= v_i_12_22 0)) InVars {count_7=v_count_7_13, count_4=v_count_4_15} OutVars{i_12=v_i_12_22, count_7=v_count_7_13, break_13=v_break_13_21, count_4=v_count_4_15} AuxVars[] AssignedVars[i_12, break_13][54]][20:4A:[125] L68-->L68: Formula: (let ((.cse0 (not v_break_13_18)) (.cse1 (select v_array_3_11 v_i_12_19)) (.cse2 (select v_array_6_11 v_i_12_19))) (and (= (+ v_i_12_19 1) v_i_12_18) (< v_i_12_19 v_len_5_13) .cse0 (< v_i_12_19 v_len_8_11) (= v_result_14_15 (ite (< .cse1 .cse2) (- 1) (ite (< .cse2 .cse1) 1 v_result_14_16))) (let ((.cse3 (= .cse1 .cse2))) (or (and .cse3 .cse0 (not v_break_13_17)) (and (or (not .cse3) v_break_13_18) v_break_13_17))))) InVars {array_6=v_array_6_11, result_14=v_result_14_16, array_3=v_array_3_11, len_5=v_len_5_13, i_12=v_i_12_19, break_13=v_break_13_18, len_8=v_len_8_11} OutVars{array_6=v_array_6_11, result_14=v_result_14_15, array_3=v_array_3_11, len_5=v_len_5_13, i_12=v_i_12_18, break_13=v_break_13_17, len_8=v_len_8_11} AuxVars[] AssignedVars[result_14, i_12, break_13][24]] [2023-10-12 17:38:23,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:23,577 INFO L124 PetriNetUnfolderBase]: 10/19 cut-off events. [2023-10-12 17:38:23,577 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:38:23,577 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:23,578 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[L121, $Ultimate##0]true [136] L121-->$Ultimate##0: 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#[$Ultimate##0, $Ultimate##0, L122]true [122] $Ultimate##0-->L68: Formula: (and (= v_count_7_13 v_count_4_15) (not v_break_13_21) (= v_i_12_22 0)) InVars {count_7=v_count_7_13, count_4=v_count_4_15} OutVars{i_12=v_i_12_22, count_7=v_count_7_13, break_13=v_break_13_21, count_4=v_count_4_15} AuxVars[] AssignedVars[i_12, break_13] 77#[L68, $Ultimate##0, L122]true [2023-10-12 17:38:23,603 INFO L750 eck$LassoCheckResult]: Loop: 77#[L68, $Ultimate##0, L122]true [125] L68-->L68: Formula: (let ((.cse0 (not v_break_13_18)) (.cse1 (select v_array_3_11 v_i_12_19)) (.cse2 (select v_array_6_11 v_i_12_19))) (and (= (+ v_i_12_19 1) v_i_12_18) (< v_i_12_19 v_len_5_13) .cse0 (< v_i_12_19 v_len_8_11) (= v_result_14_15 (ite (< .cse1 .cse2) (- 1) (ite (< .cse2 .cse1) 1 v_result_14_16))) (let ((.cse3 (= .cse1 .cse2))) (or (and .cse3 .cse0 (not v_break_13_17)) (and (or (not .cse3) v_break_13_18) v_break_13_17))))) InVars {array_6=v_array_6_11, result_14=v_result_14_16, array_3=v_array_3_11, len_5=v_len_5_13, i_12=v_i_12_19, break_13=v_break_13_18, len_8=v_len_8_11} OutVars{array_6=v_array_6_11, result_14=v_result_14_15, array_3=v_array_3_11, len_5=v_len_5_13, i_12=v_i_12_18, break_13=v_break_13_17, len_8=v_len_8_11} AuxVars[] AssignedVars[result_14, i_12, break_13] 77#[L68, $Ultimate##0, L122]true [2023-10-12 17:38:23,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:23,604 INFO L85 PathProgramCache]: Analyzing trace with hash 161942, now seen corresponding path program 1 times [2023-10-12 17:38:23,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:23,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897980050] [2023-10-12 17:38:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:23,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:23,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:23,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:23,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:23,617 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2023-10-12 17:38:23,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:23,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955094067] [2023-10-12 17:38:23,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:23,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:23,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:23,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:23,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash 5020327, now seen corresponding path program 1 times [2023-10-12 17:38:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:23,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95208171] [2023-10-12 17:38:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:23,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:23,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:23,791 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:23,791 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:23,791 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:23,792 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:23,792 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:23,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,792 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:23,792 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:23,792 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-trans.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:23,792 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:23,792 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:23,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:38:23,797 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:38:23,860 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:38:23,862 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:38:23,864 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:38:23,994 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:23,994 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:23,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,049 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:38:24,051 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:38:24,054 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:38:24,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,078 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:24,087 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:38:24,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,088 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:38:24,090 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:38:24,091 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:38:24,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:24,134 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:24,134 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:24,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,135 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:38:24,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:24,157 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:38:24,166 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:24,166 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:24,166 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_8, i_12) = 1*len_8 - 1*i_12 Supporting invariants [] [2023-10-12 17:38:24,169 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:38:24,170 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:24,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:24,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:24,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:24,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:24,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:24,194 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:38:24,194 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:38:24,259 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:38:24,260 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:38:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:24,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:24,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:24,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:24,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:24,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:24,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:24,263 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 500 transitions, 3450 flow [2023-10-12 17:38:24,263 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:24,263 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 500 transitions, 3450 flow [2023-10-12 17:38:24,282 ERROR L47 etriNetUnfolderRabin]: [1:1A:[133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][297], 4:2A:[136] L121-->$Ultimate##0: 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][247], 17:3A:[139] L122-->$Ultimate##0: 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][147], 53:4A:[127] $Ultimate##0-->L98: Formula: (and (= v_count_1_17 v_count_7_15) (not v_break_16_21) (= v_i_15_22 0)) InVars {count_7=v_count_7_15, count_1=v_count_1_17} OutVars{count_7=v_count_7_15, count_1=v_count_1_17, i_15=v_i_15_22, break_16=v_break_16_21} AuxVars[] AssignedVars[i_15, break_16][172]][54:5A:[129] L98-->L98: Formula: (let ((.cse0 (not v_break_16_16)) (.cse1 (select v_array_0_13 v_i_15_17)) (.cse2 (select v_array_6_15 v_i_15_17))) (and .cse0 (= v_i_15_16 (+ v_i_15_17 1)) (= v_result_17_17 (ite (< .cse1 .cse2) (- 1) (ite (< .cse2 .cse1) 1 v_result_17_18))) (< v_i_15_17 v_len_2_11) (let ((.cse3 (= .cse1 .cse2))) (or (and v_break_16_15 (or v_break_16_16 (not .cse3))) (and .cse0 .cse3 (not v_break_16_15)))) (< v_i_15_17 v_len_8_13))) InVars {array_6=v_array_6_15, i_15=v_i_15_17, array_0=v_array_0_13, result_17=v_result_17_18, len_2=v_len_2_11, len_8=v_len_8_13, break_16=v_break_16_16} OutVars{array_6=v_array_6_15, i_15=v_i_15_16, array_0=v_array_0_13, result_17=v_result_17_17, len_2=v_len_2_11, len_8=v_len_8_13, break_16=v_break_16_15} AuxVars[] AssignedVars[i_15, result_17, break_16][22]] [2023-10-12 17:38:24,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:24,282 INFO L124 PetriNetUnfolderBase]: 34/53 cut-off events. [2023-10-12 17:38:24,282 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:38:24,282 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:24,283 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [133] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 38#[L121, $Ultimate##0]true [136] L121-->$Ultimate##0: 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#[$Ultimate##0, $Ultimate##0, L122]true [139] L122-->$Ultimate##0: 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] 111#[$Ultimate##0, $Ultimate##0, L123, $Ultimate##0]true [127] $Ultimate##0-->L98: Formula: (and (= v_count_1_17 v_count_7_15) (not v_break_16_21) (= v_i_15_22 0)) InVars {count_7=v_count_7_15, count_1=v_count_1_17} OutVars{count_7=v_count_7_15, count_1=v_count_1_17, i_15=v_i_15_22, break_16=v_break_16_21} AuxVars[] AssignedVars[i_15, break_16] 113#[L98, $Ultimate##0, $Ultimate##0, L123]true [2023-10-12 17:38:24,283 INFO L750 eck$LassoCheckResult]: Loop: 113#[L98, $Ultimate##0, $Ultimate##0, L123]true [129] L98-->L98: Formula: (let ((.cse0 (not v_break_16_16)) (.cse1 (select v_array_0_13 v_i_15_17)) (.cse2 (select v_array_6_15 v_i_15_17))) (and .cse0 (= v_i_15_16 (+ v_i_15_17 1)) (= v_result_17_17 (ite (< .cse1 .cse2) (- 1) (ite (< .cse2 .cse1) 1 v_result_17_18))) (< v_i_15_17 v_len_2_11) (let ((.cse3 (= .cse1 .cse2))) (or (and v_break_16_15 (or v_break_16_16 (not .cse3))) (and .cse0 .cse3 (not v_break_16_15)))) (< v_i_15_17 v_len_8_13))) InVars {array_6=v_array_6_15, i_15=v_i_15_17, array_0=v_array_0_13, result_17=v_result_17_18, len_2=v_len_2_11, len_8=v_len_8_13, break_16=v_break_16_16} OutVars{array_6=v_array_6_15, i_15=v_i_15_16, array_0=v_array_0_13, result_17=v_result_17_17, len_2=v_len_2_11, len_8=v_len_8_13, break_16=v_break_16_15} AuxVars[] AssignedVars[i_15, result_17, break_16] 113#[L98, $Ultimate##0, $Ultimate##0, L123]true [2023-10-12 17:38:24,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 5020856, now seen corresponding path program 1 times [2023-10-12 17:38:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:24,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681182016] [2023-10-12 17:38:24,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:24,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:24,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:24,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:24,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2023-10-12 17:38:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:24,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617377117] [2023-10-12 17:38:24,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:24,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:24,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:24,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:24,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:24,318 INFO L85 PathProgramCache]: Analyzing trace with hash 155646665, now seen corresponding path program 1 times [2023-10-12 17:38:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348337715] [2023-10-12 17:38:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:24,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:24,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:24,452 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:24,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:24,452 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:24,452 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:24,452 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:24,452 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,452 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:24,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:24,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-trans.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:38:24,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:24,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:24,454 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:38:24,456 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:38:24,458 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:38:24,460 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:38:24,463 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:38:24,468 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:38:24,470 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:38:24,548 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:38:24,621 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:38:24,763 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:24,763 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:24,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,765 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:38:24,767 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:38:24,768 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:38:24,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:24,794 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:38:24,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,799 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:38:24,805 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:38:24,812 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:38:24,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,820 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,820 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:24,835 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:38:24,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,837 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:38:24,841 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:38:24,842 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:38:24,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,873 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:24,875 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:38:24,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,876 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:38:24,878 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:38:24,880 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:38:24,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,887 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,903 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:24,905 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:38:24,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,906 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:38:24,908 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:38:24,909 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:38:24,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:24,934 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:38:24,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,936 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:38:24,937 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:38:24,939 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:38:24,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:24,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:24,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:24,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:24,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:24,977 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:38:24,978 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:38:24,980 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:38:24,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:24,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:24,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:24,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:24,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:24,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:25,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:25,015 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-10-12 17:38:25,015 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-10-12 17:38:25,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:25,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:25,017 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:38:25,019 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:38:25,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:25,038 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:25,038 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:25,038 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_8, i_15) = 1*len_8 - 1*i_15 Supporting invariants [] [2023-10-12 17:38:25,054 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:38:25,055 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:25,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:25,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:25,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:25,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:25,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:25,079 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:38:25,079 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:38:25,141 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:38:25,143 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:38:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:25,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:25,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:25,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:38:25,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:25,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:25,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:25,144 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 2500 transitions, 22250 flow [2023-10-12 17:38:25,144 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:25,144 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 2500 transitions, 22250 flow [2023-10-12 17:38:25,194 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:38:25,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:38:25,278 INFO L124 PetriNetUnfolderBase]: 448/667 cut-off events. [2023-10-12 17:38:25,278 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2023-10-12 17:38:25,278 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:25,282 INFO L201 PluginConnector]: Adding new model word-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:25 BoogieIcfgContainer [2023-10-12 17:38:25,282 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:25,283 INFO L158 Benchmark]: Toolchain (without parser) took 3411.04ms. Allocated memory was 254.8MB in the beginning and 382.7MB in the end (delta: 127.9MB). Free memory was 204.1MB in the beginning and 295.7MB in the end (delta: -91.5MB). Peak memory consumption was 130.5MB. Max. memory is 8.0GB. [2023-10-12 17:38:25,283 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 254.8MB. Free memory was 205.6MB in the beginning and 205.4MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:25,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.70ms. Allocated memory is still 254.8MB. Free memory was 204.1MB in the beginning and 202.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:38:25,284 INFO L158 Benchmark]: Boogie Preprocessor took 13.29ms. Allocated memory is still 254.8MB. Free memory was 202.5MB in the beginning and 201.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:25,284 INFO L158 Benchmark]: RCFGBuilder took 266.56ms. Allocated memory is still 254.8MB. Free memory was 201.3MB in the beginning and 186.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-10-12 17:38:25,285 INFO L158 Benchmark]: BuchiAutomizer took 3110.64ms. Allocated memory was 254.8MB in the beginning and 382.7MB in the end (delta: 127.9MB). Free memory was 186.6MB in the beginning and 295.7MB in the end (delta: -109.0MB). Peak memory consumption was 112.7MB. Max. memory is 8.0GB. [2023-10-12 17:38:25,286 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.26ms. Allocated memory is still 254.8MB. Free memory was 205.6MB in the beginning and 205.4MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.70ms. Allocated memory is still 254.8MB. Free memory was 204.1MB in the beginning and 202.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.29ms. Allocated memory is still 254.8MB. Free memory was 202.5MB in the beginning and 201.3MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.56ms. Allocated memory is still 254.8MB. Free memory was 201.3MB in the beginning and 186.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 3110.64ms. Allocated memory was 254.8MB in the beginning and 382.7MB in the end (delta: 127.9MB). Free memory was 186.6MB in the beginning and 295.7MB in the end (delta: -109.0MB). Peak memory consumption was 112.7MB. 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 -1 * i_9 + len_2 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_12 + len_8 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_15 + len_8 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.1s. 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, 216 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 72 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp206 ukn30 mio100 lsp75 div100 bol110 ite100 ukn100 eq150 hnf100 smp100 dnf771 smp9 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s - TerminationAnalysisResult: 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.2s, 29 PlacesBefore, 24 PlacesAfterwards, 25 TransitionsBefore, 20 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 72, independent conditional: 0, independent unconditional: 72, 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: 72, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 72, unknown conditional: 0, unknown unconditional: 72] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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:38:25,297 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...