/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-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:19,339 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:19,431 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:19,450 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:19,450 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:19,451 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:19,452 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:19,452 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:19,452 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:19,453 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:19,453 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:19,453 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:19,454 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:19,454 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:19,454 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:19,455 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:19,455 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:19,455 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:19,456 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:19,456 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:19,456 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:19,459 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:19,460 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:19,460 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:19,462 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:19,462 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:19,462 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:19,462 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:19,463 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:19,463 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:19,463 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:19,463 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:19,464 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:19,464 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:19,465 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:19,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:19,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:19,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:19,707 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:19,708 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:19,709 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-subst.wvr.bpl [2023-10-12 17:38:19,709 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-subst.wvr.bpl' [2023-10-12 17:38:19,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:19,743 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:19,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:19,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:19,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:19,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,785 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:19,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:19,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:19,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:19,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:19,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:19,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:19,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:19,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:19,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/1) ... [2023-10-12 17:38:19,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:19,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:19,846 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:19,853 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:19,881 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:19,881 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:19,881 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:19,882 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:19,882 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:19,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:19,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:19,883 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:38:19,883 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:38:19,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:38:19,884 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:19,936 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:19,937 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:20,063 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:20,133 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:20,134 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-10-12 17:38:20,137 INFO L201 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:20 BoogieIcfgContainer [2023-10-12 17:38:20,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:20,138 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:20,138 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:20,143 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:20,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:20,144 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:19" (1/2) ... [2023-10-12 17:38:20,146 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41a53590 and model type word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:38:20, skipping insertion in model container [2023-10-12 17:38:20,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:20,146 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:20" (2/2) ... [2023-10-12 17:38:20,147 INFO L332 chiAutomizerObserver]: Analyzing ICFG word-subst.wvr.bpl [2023-10-12 17:38:20,260 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:38:20,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:38:20,332 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:38:20,332 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:20,336 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:20,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 86 flow [2023-10-12 17:38:20,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:20,343 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:20,356 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:20,358 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:20,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2023-10-12 17:38:20,365 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2023-10-12 17:38:20,365 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:38:20,366 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:20,366 INFO L119 LiptonReduction]: Number of co-enabled transitions 210 [2023-10-12 17:38:20,604 INFO L134 LiptonReduction]: Checked pairs total: 72 [2023-10-12 17:38:20,604 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:38:20,615 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:20,615 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:20,615 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:20,615 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:20,616 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:20,616 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:20,616 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:20,616 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:20,617 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:38:20,619 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_count_1_11 v_count_4_15) (= v_i_9_16 0)) InVars {count_4=v_count_4_15, count_1=v_count_1_11} OutVars{break_10=v_break_10_13, count_1=v_count_1_11, count_4=v_count_4_15, i_9=v_i_9_16} AuxVars[] AssignedVars[break_10, i_9][1]][3:3A:[120] L38-->L38: Formula: (let ((.cse0 (not v_break_10_18)) (.cse2 (select v_get_3_15 v_i_9_21)) (.cse3 (select v_get_0_15 v_i_9_21))) (and .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (or (not .cse1) v_break_10_18) v_break_10_17) (and (not v_break_10_17) .cse0 .cse1))) (< v_i_9_21 v_len_2_17) (= (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_11_18)) v_result_11_17) (= (+ v_i_9_21 1) v_i_9_20) (< v_i_9_21 v_len_5_15))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, get_0=v_get_0_15, len_2=v_len_2_17, len_5=v_len_5_15, i_9=v_i_9_21, get_3=v_get_3_15} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, get_0=v_get_0_15, len_2=v_len_2_17, len_5=v_len_5_15, i_9=v_i_9_20, get_3=v_get_3_15} AuxVars[] AssignedVars[break_10, result_11, i_9][7]] [2023-10-12 17:38:20,621 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:20,621 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:20,621 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:20,622 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:20,624 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:20,624 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 24 places, 20 transitions, 58 flow [2023-10-12 17:38:20,625 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_count_1_11 v_count_4_15) (= v_i_9_16 0)) InVars {count_4=v_count_4_15, count_1=v_count_1_11} OutVars{break_10=v_break_10_13, count_1=v_count_1_11, count_4=v_count_4_15, i_9=v_i_9_16} AuxVars[] AssignedVars[break_10, i_9][1]][3:3A:[120] L38-->L38: Formula: (let ((.cse0 (not v_break_10_18)) (.cse2 (select v_get_3_15 v_i_9_21)) (.cse3 (select v_get_0_15 v_i_9_21))) (and .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (or (not .cse1) v_break_10_18) v_break_10_17) (and (not v_break_10_17) .cse0 .cse1))) (< v_i_9_21 v_len_2_17) (= (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_11_18)) v_result_11_17) (= (+ v_i_9_21 1) v_i_9_20) (< v_i_9_21 v_len_5_15))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, get_0=v_get_0_15, len_2=v_len_2_17, len_5=v_len_5_15, i_9=v_i_9_21, get_3=v_get_3_15} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, get_0=v_get_0_15, len_2=v_len_2_17, len_5=v_len_5_15, i_9=v_i_9_20, get_3=v_get_3_15} AuxVars[] AssignedVars[break_10, result_11, i_9][7]] [2023-10-12 17:38:20,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:20,626 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:38:20,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:20,626 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:20,630 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_count_1_11 v_count_4_15) (= v_i_9_16 0)) InVars {count_4=v_count_4_15, count_1=v_count_1_11} OutVars{break_10=v_break_10_13, count_1=v_count_1_11, count_4=v_count_4_15, i_9=v_i_9_16} AuxVars[] AssignedVars[break_10, i_9] 40#[L121, L38]true [2023-10-12 17:38:20,630 INFO L750 eck$LassoCheckResult]: Loop: 40#[L121, L38]true [120] L38-->L38: Formula: (let ((.cse0 (not v_break_10_18)) (.cse2 (select v_get_3_15 v_i_9_21)) (.cse3 (select v_get_0_15 v_i_9_21))) (and .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (or (not .cse1) v_break_10_18) v_break_10_17) (and (not v_break_10_17) .cse0 .cse1))) (< v_i_9_21 v_len_2_17) (= (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_11_18)) v_result_11_17) (= (+ v_i_9_21 1) v_i_9_20) (< v_i_9_21 v_len_5_15))) InVars {break_10=v_break_10_18, result_11=v_result_11_18, get_0=v_get_0_15, len_2=v_len_2_17, len_5=v_len_5_15, i_9=v_i_9_21, get_3=v_get_3_15} OutVars{break_10=v_break_10_17, result_11=v_result_11_17, get_0=v_get_0_15, len_2=v_len_2_17, len_5=v_len_5_15, i_9=v_i_9_20, get_3=v_get_3_15} AuxVars[] AssignedVars[break_10, result_11, i_9] 40#[L121, L38]true [2023-10-12 17:38:20,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 5201, now seen corresponding path program 1 times [2023-10-12 17:38:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:20,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701764988] [2023-10-12 17:38:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:20,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:20,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:20,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:20,724 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2023-10-12 17:38:20,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:20,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866263335] [2023-10-12 17:38:20,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:20,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:20,739 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:20,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:20,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:20,749 INFO L85 PathProgramCache]: Analyzing trace with hash 161351, now seen corresponding path program 1 times [2023-10-12 17:38:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:20,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011934882] [2023-10-12 17:38:20,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:20,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:20,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:21,018 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:21,019 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:21,020 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:21,020 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:21,020 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:21,020 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,020 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:21,020 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:21,020 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:21,020 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:21,021 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:21,038 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:21,049 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:21,051 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:21,370 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:21,373 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:21,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,378 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:21,383 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:21,389 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:21,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:21,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:21,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:21,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:21,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:21,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:21,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:21,449 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:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,451 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:21,461 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:21,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:21,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:21,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:21,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:21,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:21,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:21,476 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:21,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:21,493 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:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,495 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:21,499 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:21,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:21,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:21,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:21,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:21,512 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:21,512 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:21,519 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:21,525 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:21,533 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:21,533 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:21,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,541 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:21,577 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:21,578 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:21,595 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:21,596 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:21,596 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9, len_5) = -1*i_9 + 1*len_5 Supporting invariants [] [2023-10-12 17:38:21,602 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:21,605 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:21,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:21,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:21,635 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:21,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:21,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:21,652 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:21,686 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:21,785 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:21,790 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:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:21,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:21,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:21,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:21,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:21,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:21,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:21,801 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 100 transitions, 490 flow [2023-10-12 17:38:21,803 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:21,803 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 100 transitions, 490 flow [2023-10-12 17:38:21,815 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_1_15 v_count_7_13) (not v_break_13_21) (= v_i_12_22 0)) InVars {count_7=v_count_7_13, count_1=v_count_1_15} OutVars{i_12=v_i_12_22, count_7=v_count_7_13, count_1=v_count_1_15, break_13=v_break_13_21} AuxVars[] AssignedVars[i_12, break_13][54]][20:4A:[125] L68-->L68: Formula: (let ((.cse0 (not v_break_13_18)) (.cse2 (select v_get_6_11 v_i_12_19)) (.cse1 (select v_get_0_11 v_i_12_19))) (and (= (+ v_i_12_19 1) v_i_12_18) .cse0 (< v_i_12_19 v_len_8_11) (< v_i_12_19 v_len_2_13) (= (ite (< .cse1 .cse2) (- 1) (ite (< .cse2 .cse1) 1 v_result_14_16)) v_result_14_15) (let ((.cse3 (= .cse2 .cse1))) (or (and (or (not .cse3) v_break_13_18) v_break_13_17) (and .cse3 .cse0 (not v_break_13_17)))))) InVars {get_0=v_get_0_11, result_14=v_result_14_16, len_2=v_len_2_13, i_12=v_i_12_19, break_13=v_break_13_18, get_6=v_get_6_11, len_8=v_len_8_11} OutVars{get_0=v_get_0_11, result_14=v_result_14_15, len_2=v_len_2_13, i_12=v_i_12_18, break_13=v_break_13_17, get_6=v_get_6_11, len_8=v_len_8_11} AuxVars[] AssignedVars[result_14, i_12, break_13][24]] [2023-10-12 17:38:21,815 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:21,815 INFO L124 PetriNetUnfolderBase]: 10/19 cut-off events. [2023-10-12 17:38:21,816 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-10-12 17:38:21,816 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:21,816 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_1_15 v_count_7_13) (not v_break_13_21) (= v_i_12_22 0)) InVars {count_7=v_count_7_13, count_1=v_count_1_15} OutVars{i_12=v_i_12_22, count_7=v_count_7_13, count_1=v_count_1_15, break_13=v_break_13_21} AuxVars[] AssignedVars[i_12, break_13] 77#[L68, $Ultimate##0, L122]true [2023-10-12 17:38:21,817 INFO L750 eck$LassoCheckResult]: Loop: 77#[L68, $Ultimate##0, L122]true [125] L68-->L68: Formula: (let ((.cse0 (not v_break_13_18)) (.cse2 (select v_get_6_11 v_i_12_19)) (.cse1 (select v_get_0_11 v_i_12_19))) (and (= (+ v_i_12_19 1) v_i_12_18) .cse0 (< v_i_12_19 v_len_8_11) (< v_i_12_19 v_len_2_13) (= (ite (< .cse1 .cse2) (- 1) (ite (< .cse2 .cse1) 1 v_result_14_16)) v_result_14_15) (let ((.cse3 (= .cse2 .cse1))) (or (and (or (not .cse3) v_break_13_18) v_break_13_17) (and .cse3 .cse0 (not v_break_13_17)))))) InVars {get_0=v_get_0_11, result_14=v_result_14_16, len_2=v_len_2_13, i_12=v_i_12_19, break_13=v_break_13_18, get_6=v_get_6_11, len_8=v_len_8_11} OutVars{get_0=v_get_0_11, result_14=v_result_14_15, len_2=v_len_2_13, i_12=v_i_12_18, break_13=v_break_13_17, get_6=v_get_6_11, 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:21,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 161942, now seen corresponding path program 1 times [2023-10-12 17:38:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635350957] [2023-10-12 17:38:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:21,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash 156, now seen corresponding path program 1 times [2023-10-12 17:38:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351353367] [2023-10-12 17:38:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:21,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash 5020327, now seen corresponding path program 1 times [2023-10-12 17:38:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601373794] [2023-10-12 17:38:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,067 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:22,068 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:22,068 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:22,068 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:22,068 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:22,068 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,068 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:22,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:22,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:22,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:22,069 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:22,072 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,074 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,076 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,151 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:22,154 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,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:22,348 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:22,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,353 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:22,356 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:22,357 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:22,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:22,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:22,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:22,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:22,367 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:22,367 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:22,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:22,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:38:22,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,389 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:22,397 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:22,399 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:22,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:22,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:22,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:22,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:22,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:22,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:22,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:22,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2023-10-12 17:38:22,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,429 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:22,440 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:22,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:22,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:22,448 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:38:22,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:22,456 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:22,472 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:38:22,473 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:38:22,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:22,516 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:22,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,518 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:22,520 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:22,522 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:22,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:22,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:22,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:22,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:22,532 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:22,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:22,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:22,563 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:22,564 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:22,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,569 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:22,580 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:22,589 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:22,600 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:22,600 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:22,600 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:22,605 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:22,606 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:22,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:22,628 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:22,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:22,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:22,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:22,637 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:22,638 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:22,725 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:22,726 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:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:22,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:22,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:22,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:22,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,730 INFO L430 stractBuchiCegarLoop]: Abstraction has has 34 places, 500 transitions, 3450 flow [2023-10-12 17:38:22,730 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:22,730 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 34 places, 500 transitions, 3450 flow [2023-10-12 17:38:22,755 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_7_15 v_count_4_17) (not v_break_16_21) (= v_i_15_22 0)) InVars {count_7=v_count_7_15, count_4=v_count_4_17} OutVars{count_7=v_count_7_15, i_15=v_i_15_22, count_4=v_count_4_17, 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)) (.cse2 (select v_get_6_15 v_i_15_17)) (.cse1 (select v_get_3_13 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))) (let ((.cse3 (= .cse2 .cse1))) (or (and (or v_break_16_16 (not .cse3)) v_break_16_15) (and .cse0 (not v_break_16_15) .cse3))) (< v_i_15_17 v_len_8_13) (< v_i_15_17 v_len_5_11))) InVars {i_15=v_i_15_17, result_17=v_result_17_18, len_5=v_len_5_11, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_16, get_3=v_get_3_13} OutVars{i_15=v_i_15_16, result_17=v_result_17_17, len_5=v_len_5_11, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_15, get_3=v_get_3_13} AuxVars[] AssignedVars[i_15, result_17, break_16][22]] [2023-10-12 17:38:22,755 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:22,755 INFO L124 PetriNetUnfolderBase]: 34/53 cut-off events. [2023-10-12 17:38:22,756 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:38:22,756 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:22,756 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_7_15 v_count_4_17) (not v_break_16_21) (= v_i_15_22 0)) InVars {count_7=v_count_7_15, count_4=v_count_4_17} OutVars{count_7=v_count_7_15, i_15=v_i_15_22, count_4=v_count_4_17, 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:22,756 INFO L750 eck$LassoCheckResult]: Loop: 113#[L98, $Ultimate##0, $Ultimate##0, L123]true [129] L98-->L98: Formula: (let ((.cse0 (not v_break_16_16)) (.cse2 (select v_get_6_15 v_i_15_17)) (.cse1 (select v_get_3_13 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))) (let ((.cse3 (= .cse2 .cse1))) (or (and (or v_break_16_16 (not .cse3)) v_break_16_15) (and .cse0 (not v_break_16_15) .cse3))) (< v_i_15_17 v_len_8_13) (< v_i_15_17 v_len_5_11))) InVars {i_15=v_i_15_17, result_17=v_result_17_18, len_5=v_len_5_11, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_16, get_3=v_get_3_13} OutVars{i_15=v_i_15_16, result_17=v_result_17_17, len_5=v_len_5_11, get_6=v_get_6_15, len_8=v_len_8_13, break_16=v_break_16_15, get_3=v_get_3_13} AuxVars[] AssignedVars[i_15, result_17, break_16] 113#[L98, $Ultimate##0, $Ultimate##0, L123]true [2023-10-12 17:38:22,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 5020856, now seen corresponding path program 1 times [2023-10-12 17:38:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635850114] [2023-10-12 17:38:22,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 160, now seen corresponding path program 1 times [2023-10-12 17:38:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688683333] [2023-10-12 17:38:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash 155646665, now seen corresponding path program 1 times [2023-10-12 17:38:22,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058914146] [2023-10-12 17:38:22,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,992 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:22,992 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:22,993 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:22,993 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:22,993 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:22,993 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:22,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:22,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-subst.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:38:22,993 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:22,993 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:22,995 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:38:23,066 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,069 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,072 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,074 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,084 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,087 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,091 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,302 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:23,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:23,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:23,305 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:23,314 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,320 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:23,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:23,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:23,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:23,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:23,324 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:23,324 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:23,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:23,344 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:23,345 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:23,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:23,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:23,353 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:23,355 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:23,356 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:23,363 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:23,363 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:23,363 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_5, i_15) = 1*len_5 - 1*i_15 Supporting invariants [] [2023-10-12 17:38:23,369 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:23,370 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:23,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:23,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:23,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:23,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:23,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:23,399 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,399 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,458 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,479 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:23,488 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:23,518 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,519 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:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-10-12 17:38:23,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:23,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:23,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:38:23,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:23,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 158 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:38:23,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:23,520 INFO L430 stractBuchiCegarLoop]: Abstraction has has 39 places, 2500 transitions, 22250 flow [2023-10-12 17:38:23,520 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:38:23,520 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 39 places, 2500 transitions, 22250 flow [2023-10-12 17:38:23,673 INFO L124 PetriNetUnfolderBase]: 448/667 cut-off events. [2023-10-12 17:38:23,673 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2023-10-12 17:38:23,673 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:23,678 INFO L201 PluginConnector]: Adding new model word-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:23 BoogieIcfgContainer [2023-10-12 17:38:23,678 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:23,679 INFO L158 Benchmark]: Toolchain (without parser) took 3935.34ms. Allocated memory was 181.4MB in the beginning and 268.4MB in the end (delta: 87.0MB). Free memory was 136.4MB in the beginning and 171.1MB in the end (delta: -34.7MB). Peak memory consumption was 52.5MB. Max. memory is 8.0GB. [2023-10-12 17:38:23,679 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 181.4MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:23,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.77ms. Allocated memory is still 181.4MB. Free memory was 136.4MB in the beginning and 134.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:23,680 INFO L158 Benchmark]: Boogie Preprocessor took 22.16ms. Allocated memory is still 181.4MB. Free memory was 134.7MB in the beginning and 133.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:23,680 INFO L158 Benchmark]: RCFGBuilder took 326.21ms. Allocated memory is still 181.4MB. Free memory was 133.6MB in the beginning and 118.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-10-12 17:38:23,681 INFO L158 Benchmark]: BuchiAutomizer took 3540.62ms. Allocated memory was 181.4MB in the beginning and 268.4MB in the end (delta: 87.0MB). Free memory was 118.5MB in the beginning and 171.1MB in the end (delta: -52.6MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2023-10-12 17:38:23,682 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.25ms. Allocated memory is still 181.4MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.77ms. Allocated memory is still 181.4MB. Free memory was 136.4MB in the beginning and 134.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.16ms. Allocated memory is still 181.4MB. Free memory was 134.7MB in the beginning and 133.6MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 326.21ms. Allocated memory is still 181.4MB. Free memory was 133.6MB in the beginning and 118.8MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 3540.62ms. Allocated memory was 181.4MB in the beginning and 268.4MB in the end (delta: 87.0MB). Free memory was 118.5MB in the beginning and 171.1MB in the end (delta: -52.6MB). Peak memory consumption was 34.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_5 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_5 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.3s. 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.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 108 SdHoareTripleChecker+Invalid, 0.2s 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 ukn28 mio100 lsp74 div100 bol111 ite100 ukn100 eq145 hnf100 smp100 dnf819 smp10 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 84ms VariablesStem: 1 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.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:23,694 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...