/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-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:38:20,061 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:38:20,121 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:20,145 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:38:20,145 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:38:20,146 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:38:20,146 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:38:20,147 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:38:20,147 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:38:20,150 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:38:20,150 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:38:20,150 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:38:20,151 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:38:20,151 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:38:20,152 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:38:20,152 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:38:20,152 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:38:20,152 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:38:20,153 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:38:20,153 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:38:20,153 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:38:20,153 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:38:20,154 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:38:20,154 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:38:20,154 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:38:20,155 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:38:20,155 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:38:20,155 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:38:20,155 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:38:20,155 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:38:20,156 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:38:20,156 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:38:20,156 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:38:20,157 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:38:20,157 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:20,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:38:20,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:38:20,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:38:20,369 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:38:20,370 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:38:20,371 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-symm.wvr.bpl [2023-10-12 17:38:20,371 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-symm.wvr.bpl' [2023-10-12 17:38:20,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:38:20,403 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:38:20,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:20,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:38:20,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:38:20,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,424 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:38:20,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:38:20,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:38:20,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:38:20,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:38:20,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:38:20,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:38:20,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:38:20,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:38:20,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/1) ... [2023-10-12 17:38:20,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:20,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:20,464 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:20,492 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:20,502 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:38:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:38:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:38:20,505 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:38:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:38:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:38:20,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:38:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:38:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:38:20,507 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:20,545 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:38:20,547 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:38:20,648 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:38:20,677 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:38:20,677 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-10-12 17:38:20,679 INFO L201 PluginConnector]: Adding new model word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:20 BoogieIcfgContainer [2023-10-12 17:38:20,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:38:20,679 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:38:20,680 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:38:20,682 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:38:20,683 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:20,683 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:38:20" (1/2) ... [2023-10-12 17:38:20,684 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6b56b17 and model type word-symm.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,684 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:38:20,684 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:38:20" (2/2) ... [2023-10-12 17:38:20,685 INFO L332 chiAutomizerObserver]: Analyzing ICFG word-symm.wvr.bpl [2023-10-12 17:38:20,725 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:38:20,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 60 flow [2023-10-12 17:38:20,782 INFO L124 PetriNetUnfolderBase]: 4/18 cut-off events. [2023-10-12 17:38:20,782 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:20,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 4/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2023-10-12 17:38:20,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 60 flow [2023-10-12 17:38:20,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 48 flow [2023-10-12 17:38:20,790 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:38:20,799 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 18 transitions, 48 flow [2023-10-12 17:38:20,801 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 18 transitions, 48 flow [2023-10-12 17:38:20,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 48 flow [2023-10-12 17:38:20,813 INFO L124 PetriNetUnfolderBase]: 4/18 cut-off events. [2023-10-12 17:38:20,813 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:20,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 4/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2023-10-12 17:38:20,814 INFO L119 LiptonReduction]: Number of co-enabled transitions 70 [2023-10-12 17:38:20,991 INFO L134 LiptonReduction]: Checked pairs total: 24 [2023-10-12 17:38:20,992 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-10-12 17:38:21,000 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:38:21,000 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:38:21,001 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:38:21,001 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:38:21,001 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:38:21,001 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:38:21,001 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:38:21,001 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:38:21,001 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 17 places, 14 transitions, 40 flow [2023-10-12 17:38:21,004 ERROR L47 etriNetUnfolderRabin]: [1:1A:[92] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:2A:[81] $Ultimate##0-->L32: Formula: (and (not v_break_7_21) (= v_count_1_15 v_count_4_15) (= v_i_6_22 0)) InVars {count_4=v_count_4_15, count_1=v_count_1_15} OutVars{i_6=v_i_6_22, count_1=v_count_1_15, break_7=v_break_7_21, count_4=v_count_4_15} AuxVars[] AssignedVars[i_6, break_7][1]][4:3A:[83] L32-->L32: Formula: (let ((.cse0 (not v_break_7_14)) (.cse2 (select v_array_3_13 v_i_6_15)) (.cse3 (select v_array_0_13 v_i_6_15))) (and (< v_i_6_15 v_len_2_9) .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (not v_break_7_13) .cse0 .cse1) (and (or (not .cse1) v_break_7_14) v_break_7_13))) (= v_result_8_13 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_8_14))) (= (+ v_i_6_15 1) v_i_6_14) (< v_i_6_15 v_len_5_9))) InVars {i_6=v_i_6_15, result_8=v_result_8_14, array_3=v_array_3_13, break_7=v_break_7_14, array_0=v_array_0_13, len_2=v_len_2_9, len_5=v_len_5_9} OutVars{i_6=v_i_6_14, result_8=v_result_8_13, array_3=v_array_3_13, break_7=v_break_7_13, array_0=v_array_0_13, len_2=v_len_2_9, len_5=v_len_5_9} AuxVars[] AssignedVars[i_6, result_8, break_7][7]] [2023-10-12 17:38:21,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:21,005 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:38:21,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:21,005 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:21,007 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:38:21,007 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 17 places, 14 transitions, 40 flow [2023-10-12 17:38:21,008 ERROR L47 etriNetUnfolderRabin]: [1:1A:[92] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][5], 3:2A:[81] $Ultimate##0-->L32: Formula: (and (not v_break_7_21) (= v_count_1_15 v_count_4_15) (= v_i_6_22 0)) InVars {count_4=v_count_4_15, count_1=v_count_1_15} OutVars{i_6=v_i_6_22, count_1=v_count_1_15, break_7=v_break_7_21, count_4=v_count_4_15} AuxVars[] AssignedVars[i_6, break_7][1]][4:3A:[83] L32-->L32: Formula: (let ((.cse0 (not v_break_7_14)) (.cse2 (select v_array_3_13 v_i_6_15)) (.cse3 (select v_array_0_13 v_i_6_15))) (and (< v_i_6_15 v_len_2_9) .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (not v_break_7_13) .cse0 .cse1) (and (or (not .cse1) v_break_7_14) v_break_7_13))) (= v_result_8_13 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_8_14))) (= (+ v_i_6_15 1) v_i_6_14) (< v_i_6_15 v_len_5_9))) InVars {i_6=v_i_6_15, result_8=v_result_8_14, array_3=v_array_3_13, break_7=v_break_7_14, array_0=v_array_0_13, len_2=v_len_2_9, len_5=v_len_5_9} OutVars{i_6=v_i_6_14, result_8=v_result_8_13, array_3=v_array_3_13, break_7=v_break_7_13, array_0=v_array_0_13, len_2=v_len_2_9, len_5=v_len_5_9} AuxVars[] AssignedVars[i_6, result_8, break_7][7]] [2023-10-12 17:38:21,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:21,008 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-10-12 17:38:21,008 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:38:21,008 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:21,011 INFO L748 eck$LassoCheckResult]: Stem: 27#[$Ultimate##0]true [92] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 29#[L85, $Ultimate##0]true [81] $Ultimate##0-->L32: Formula: (and (not v_break_7_21) (= v_count_1_15 v_count_4_15) (= v_i_6_22 0)) InVars {count_4=v_count_4_15, count_1=v_count_1_15} OutVars{i_6=v_i_6_22, count_1=v_count_1_15, break_7=v_break_7_21, count_4=v_count_4_15} AuxVars[] AssignedVars[i_6, break_7] 31#[L85, L32]true [2023-10-12 17:38:21,011 INFO L750 eck$LassoCheckResult]: Loop: 31#[L85, L32]true [83] L32-->L32: Formula: (let ((.cse0 (not v_break_7_14)) (.cse2 (select v_array_3_13 v_i_6_15)) (.cse3 (select v_array_0_13 v_i_6_15))) (and (< v_i_6_15 v_len_2_9) .cse0 (let ((.cse1 (= .cse2 .cse3))) (or (and (not v_break_7_13) .cse0 .cse1) (and (or (not .cse1) v_break_7_14) v_break_7_13))) (= v_result_8_13 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_8_14))) (= (+ v_i_6_15 1) v_i_6_14) (< v_i_6_15 v_len_5_9))) InVars {i_6=v_i_6_15, result_8=v_result_8_14, array_3=v_array_3_13, break_7=v_break_7_14, array_0=v_array_0_13, len_2=v_len_2_9, len_5=v_len_5_9} OutVars{i_6=v_i_6_14, result_8=v_result_8_13, array_3=v_array_3_13, break_7=v_break_7_13, array_0=v_array_0_13, len_2=v_len_2_9, len_5=v_len_5_9} AuxVars[] AssignedVars[i_6, result_8, break_7] 31#[L85, L32]true [2023-10-12 17:38:21,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 3894, now seen corresponding path program 1 times [2023-10-12 17:38:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099668667] [2023-10-12 17:38:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:21,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2023-10-12 17:38:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66439301] [2023-10-12 17:38:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:21,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 120797, now seen corresponding path program 1 times [2023-10-12 17:38:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837957883] [2023-10-12 17:38:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:21,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:21,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:21,380 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:21,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:21,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:21,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:21,381 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:21,381 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,381 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:21,381 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:21,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-symm.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:38:21,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:21,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:21,399 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,408 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,500 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,705 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:21,709 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:21,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,712 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,727 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,727 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,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:21,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:21,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:21,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:21,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:21,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:21,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:21,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:38:21,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,762 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,771 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,773 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,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:21,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:21,779 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:38:21,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:21,804 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:38:21,804 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:38:21,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:21,840 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,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,842 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,843 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,845 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,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:21,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:21,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:21,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:21,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:21,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:21,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:21,877 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:21,877 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:21,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:21,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:21,880 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,882 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,926 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:21,961 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:21,961 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:21,962 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_2, i_6) = 1*len_2 - 1*i_6 Supporting invariants [] [2023-10-12 17:38:21,967 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,969 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:21,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:21,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:21,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:22,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:22,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:22,021 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,028 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:22,067 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,129 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,134 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:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2023-10-12 17:38:22,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:38:22,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:22,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:38:22,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,141 INFO L430 stractBuchiCegarLoop]: Abstraction has has 22 places, 70 transitions, 340 flow [2023-10-12 17:38:22,142 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:38:22,143 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 22 places, 70 transitions, 340 flow [2023-10-12 17:38:22,150 ERROR L47 etriNetUnfolderRabin]: [1:1A:[92] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0][27], 2:2A:[95] L85-->$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][2], 14:3A:[86] $Ultimate##0-->L62: Formula: (and (not v_break_10_17) (= v_count_1_13 v_count_4_13) (= v_i_9_20 0)) InVars {count_4=v_count_4_13, count_1=v_count_1_13} OutVars{break_10=v_break_10_17, count_1=v_count_1_13, count_4=v_count_4_13, i_9=v_i_9_20} AuxVars[] AssignedVars[break_10, i_9][22]][15:4A:[89] L62-->L62: Formula: (let ((.cse0 (select v_array_3_15 v_i_9_23)) (.cse1 (select v_array_0_15 v_i_9_23)) (.cse3 (not v_break_10_20))) (and (= (ite (< .cse0 .cse1) (- 1) (ite (< .cse1 .cse0) 1 v_result_11_18)) v_result_11_17) (< v_i_9_23 v_len_5_13) (< v_i_9_23 v_len_2_13) (= (+ v_i_9_23 1) v_i_9_22) (let ((.cse2 (= .cse0 .cse1))) (or (and (or (not .cse2) v_break_10_20) v_break_10_19) (and (not v_break_10_19) .cse3 .cse2))) .cse3)) InVars {break_10=v_break_10_20, result_11=v_result_11_18, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_13, len_5=v_len_5_13, i_9=v_i_9_23} OutVars{break_10=v_break_10_19, result_11=v_result_11_17, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_13, len_5=v_len_5_13, i_9=v_i_9_22} AuxVars[] AssignedVars[break_10, result_11, i_9][32]] [2023-10-12 17:38:22,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:38:22,154 INFO L124 PetriNetUnfolderBase]: 7/14 cut-off events. [2023-10-12 17:38:22,154 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:38:22,154 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:38:22,155 INFO L748 eck$LassoCheckResult]: Stem: 27#[$Ultimate##0]true [92] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 29#[L85, $Ultimate##0]true [95] L85-->$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] 66#[L86, $Ultimate##0, $Ultimate##0]true [86] $Ultimate##0-->L62: Formula: (and (not v_break_10_17) (= v_count_1_13 v_count_4_13) (= v_i_9_20 0)) InVars {count_4=v_count_4_13, count_1=v_count_1_13} OutVars{break_10=v_break_10_17, count_1=v_count_1_13, count_4=v_count_4_13, i_9=v_i_9_20} AuxVars[] AssignedVars[break_10, i_9] 68#[L86, $Ultimate##0, L62]true [2023-10-12 17:38:22,155 INFO L750 eck$LassoCheckResult]: Loop: 68#[L86, $Ultimate##0, L62]true [89] L62-->L62: Formula: (let ((.cse0 (select v_array_3_15 v_i_9_23)) (.cse1 (select v_array_0_15 v_i_9_23)) (.cse3 (not v_break_10_20))) (and (= (ite (< .cse0 .cse1) (- 1) (ite (< .cse1 .cse0) 1 v_result_11_18)) v_result_11_17) (< v_i_9_23 v_len_5_13) (< v_i_9_23 v_len_2_13) (= (+ v_i_9_23 1) v_i_9_22) (let ((.cse2 (= .cse0 .cse1))) (or (and (or (not .cse2) v_break_10_20) v_break_10_19) (and (not v_break_10_19) .cse3 .cse2))) .cse3)) InVars {break_10=v_break_10_20, result_11=v_result_11_18, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_13, len_5=v_len_5_13, i_9=v_i_9_23} OutVars{break_10=v_break_10_19, result_11=v_result_11_17, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_13, len_5=v_len_5_13, i_9=v_i_9_22} AuxVars[] AssignedVars[break_10, result_11, i_9] 68#[L86, $Ultimate##0, L62]true [2023-10-12 17:38:22,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 121234, now seen corresponding path program 1 times [2023-10-12 17:38:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781696706] [2023-10-12 17:38:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash 120, now seen corresponding path program 1 times [2023-10-12 17:38:22,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799832127] [2023-10-12 17:38:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,181 INFO L85 PathProgramCache]: Analyzing trace with hash 3758343, now seen corresponding path program 1 times [2023-10-12 17:38:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:38:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982270260] [2023-10-12 17:38:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:38:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:38:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:38:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:38:22,192 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:38:22,320 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:38:22,320 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:38:22,320 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:38:22,320 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:38:22,321 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:38:22,321 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:38:22,321 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:38:22,321 INFO L133 ssoRankerPreferences]: Filename of dumped script: word-symm.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:38:22,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:38:22,321 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:38:22,323 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,325 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,388 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,391 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,393 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,551 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:38:22,551 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:38:22,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,552 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,554 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,566 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,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:22,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:22,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:22,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:22,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:22,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:22,593 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:38:22,598 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,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,600 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,602 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,604 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,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:38:22,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:38:22,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:38:22,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:38:22,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:38:22,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:38:22,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:38:22,637 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:38:22,637 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:38:22,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:38:22,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:38:22,649 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,652 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,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:38:22,674 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:38:22,674 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:38:22,674 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:22,681 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:22,682 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:38:22,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:38:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:22,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:38:22,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:38:22,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:38:22,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:38:22,706 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,707 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,749 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,750 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,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2023-10-12 17:38:22,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:38:22,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:38:22,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 114 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:38:22,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:38:22,751 INFO L430 stractBuchiCegarLoop]: Abstraction has has 27 places, 350 transitions, 2400 flow [2023-10-12 17:38:22,751 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:38:22,751 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 27 places, 350 transitions, 2400 flow [2023-10-12 17:38:22,765 INFO L124 PetriNetUnfolderBase]: 46/91 cut-off events. [2023-10-12 17:38:22,765 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-10-12 17:38:22,766 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:38:22,770 INFO L201 PluginConnector]: Adding new model word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:38:22 BoogieIcfgContainer [2023-10-12 17:38:22,770 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:38:22,770 INFO L158 Benchmark]: Toolchain (without parser) took 2367.65ms. Allocated memory was 224.4MB in the beginning and 352.3MB in the end (delta: 127.9MB). Free memory was 174.2MB in the beginning and 259.4MB in the end (delta: -85.2MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2023-10-12 17:38:22,771 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 224.4MB. Free memory was 175.5MB in the beginning and 175.3MB in the end (delta: 201.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:38:22,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.20ms. Allocated memory is still 224.4MB. Free memory was 174.0MB in the beginning and 172.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:22,771 INFO L158 Benchmark]: Boogie Preprocessor took 13.99ms. Allocated memory is still 224.4MB. Free memory was 172.5MB in the beginning and 171.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:38:22,772 INFO L158 Benchmark]: RCFGBuilder took 238.82ms. Allocated memory is still 224.4MB. Free memory was 171.2MB in the beginning and 158.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-10-12 17:38:22,772 INFO L158 Benchmark]: BuchiAutomizer took 2090.41ms. Allocated memory was 224.4MB in the beginning and 352.3MB in the end (delta: 127.9MB). Free memory was 158.6MB in the beginning and 259.4MB in the end (delta: -100.8MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2023-10-12 17:38:22,774 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21ms. Allocated memory is still 224.4MB. Free memory was 175.5MB in the beginning and 175.3MB in the end (delta: 201.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.20ms. Allocated memory is still 224.4MB. Free memory was 174.0MB in the beginning and 172.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.99ms. Allocated memory is still 224.4MB. Free memory was 172.5MB in the beginning and 171.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.82ms. Allocated memory is still 224.4MB. Free memory was 171.2MB in the beginning and 158.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2090.41ms. Allocated memory was 224.4MB in the beginning and 352.3MB in the end (delta: 127.9MB). Free memory was 158.6MB in the beginning and 259.4MB in the end (delta: -100.8MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len_2 + -1 * i_6 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_9 + len_2 and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 36 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp212 ukn28 mio100 lsp74 div100 bol111 ite100 ukn100 eq145 hnf100 smp100 dnf819 smp10 tf100 neg100 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 76ms 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.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, 21 PlacesBefore, 17 PlacesAfterwards, 18 TransitionsBefore, 14 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , 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:22,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:38:22,990 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...