/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-symm.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:01,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:01,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:01,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:01,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:01,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:01,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:01,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:01,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:01,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:01,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:01,851 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:01,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:01,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:01,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:01,852 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:01,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:01,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:01,854 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:01,854 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:01,854 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:02,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:02,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:02,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:02,073 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:02,074 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:02,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-symm.wvr.bpl [2025-04-26 16:55:02,076 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/word-symm.wvr.bpl' [2025-04-26 16:55:02,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:02,099 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:02,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:02,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:02,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:02,111 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 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,132 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 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,137 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:02,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:02,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:02,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:02,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:02,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,152 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:02,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:02,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:02,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:02,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/1) ... [2025-04-26 16:55:02,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:02,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:02,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:02,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:55:02,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:02,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:02,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:02,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:02,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:02,216 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:02,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:02,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:02,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:02,217 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:55:02,256 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:02,258 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:02,366 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:02,366 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:02,399 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:02,399 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:55:02,400 INFO L201 PluginConnector]: Adding new model word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:02 BoogieIcfgContainer [2025-04-26 16:55:02,400 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:02,400 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:02,400 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:02,404 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:02,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:02,405 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:02" (1/2) ... [2025-04-26 16:55:02,406 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dc4be51 and model type word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:02, skipping insertion in model container [2025-04-26 16:55:02,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:02,406 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:02" (2/2) ... [2025-04-26 16:55:02,407 INFO L376 chiAutomizerObserver]: Analyzing ICFG word-symm.wvr.bpl [2025-04-26 16:55:02,457 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:55:02,495 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:02,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:02,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:02,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:02,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:55:02,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 22 transitions, 58 flow [2025-04-26 16:55:02,565 INFO L116 PetriNetUnfolderBase]: 4/18 cut-off events. [2025-04-26 16:55:02,566 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:55:02,570 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 17 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. [2025-04-26 16:55:02,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 22 transitions, 58 flow [2025-04-26 16:55:02,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 18 transitions, 48 flow [2025-04-26 16:55:02,573 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 21 places, 18 transitions, 48 flow [2025-04-26 16:55:02,578 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:02,604 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46#[L62, L86, thread1EXIT]true [2025-04-26 16:55:02,604 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 30#[L32, L85]true [2025-04-26 16:55:02,607 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 68#[L32, L86, L62]true [2025-04-26 16:55:02,608 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 70#[L32, L75, L86]true [2025-04-26 16:55:02,608 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 16:55:02,608 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 4 [2025-04-26 16:55:02,608 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 4 [2025-04-26 16:55:02,608 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:12 [2025-04-26 16:55:02,609 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:11 [2025-04-26 16:55:02,609 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:55:02,609 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:55:02,609 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:02,610 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:02,617 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:02,617 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:02,617 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:02,617 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:02,617 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:02,617 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:02,617 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:02,618 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:02,619 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:02,626 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:55:02,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:02,627 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:02,630 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:02,631 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:55:02,631 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:02,631 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:02,634 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 6 [2025-04-26 16:55:02,634 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:02,634 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:02,634 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:02,635 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:55:02,639 INFO L752 eck$LassoCheckResult]: Stem: "[92] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] $Ultimate##0-->L32: Formula: (and (= v_count_4_7 v_count_1_7) (= v_i_6_10 0) (not v_break_7_9)) InVars {count_4=v_count_4_7, count_1=v_count_1_7} OutVars{i_6=v_i_6_10, count_1=v_count_1_7, break_7=v_break_7_9, count_4=v_count_4_7} AuxVars[] AssignedVars[i_6, break_7]" [2025-04-26 16:55:02,640 INFO L754 eck$LassoCheckResult]: Loop: "[83] L32-->L32: Formula: (let ((.cse1 (not v_break_7_22)) (.cse2 (select v_array_3_9 v_i_6_23)) (.cse3 (select v_array_0_9 v_i_6_23))) (and (< v_i_6_23 v_len_5_9) (= (+ v_i_6_23 1) v_i_6_22) (let ((.cse0 (= .cse2 .cse3))) (or (and (or (not .cse0) v_break_7_22) v_break_7_21) (and (not v_break_7_21) .cse1 .cse0))) .cse1 (= v_result_8_17 (ite (< .cse3 .cse2) (- 1) (ite (< .cse2 .cse3) 1 v_result_8_18))) (< v_i_6_23 v_len_2_9))) InVars {i_6=v_i_6_23, result_8=v_result_8_18, array_3=v_array_3_9, break_7=v_break_7_22, array_0=v_array_0_9, len_2=v_len_2_9, len_5=v_len_5_9} OutVars{i_6=v_i_6_22, result_8=v_result_8_17, array_3=v_array_3_9, break_7=v_break_7_21, array_0=v_array_0_9, len_2=v_len_2_9, len_5=v_len_5_9} AuxVars[] AssignedVars[i_6, result_8, break_7]" [2025-04-26 16:55:02,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 3893, now seen corresponding path program 1 times [2025-04-26 16:55:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:02,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761051027] [2025-04-26 16:55:02,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:02,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:02,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:02,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:02,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:02,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:02,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:02,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:02,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:02,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:02,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:02,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash 114, now seen corresponding path program 1 times [2025-04-26 16:55:02,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:02,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750407816] [2025-04-26 16:55:02,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:02,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:55:02,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:55:02,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:02,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:02,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:02,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:55:02,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:55:02,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:02,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:02,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:02,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 120766, now seen corresponding path program 1 times [2025-04-26 16:55:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:02,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208485754] [2025-04-26 16:55:02,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:02,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:02,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:02,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:02,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:02,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:02,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:02,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:02,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:02,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:02,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:02,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:03,071 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:03,072 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:03,072 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:03,072 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:03,072 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:03,072 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:03,072 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:03,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:03,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-symm.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:03,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:03,073 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:03,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:03,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:03,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:03,397 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:03,401 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:03,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:03,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:55:03,407 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 [2025-04-26 16:55:03,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:03,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:03,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:03,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:03,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:03,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:03,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:03,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:03,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:03,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:03,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:03,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:55:03,444 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 [2025-04-26 16:55:03,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:03,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:03,455 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:55:03,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:03,475 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:55:03,475 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:55:03,501 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:03,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:55:03,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:03,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:03,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:03,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:55:03,514 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 [2025-04-26 16:55:03,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:03,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:03,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:03,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:03,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:03,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:03,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:03,551 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:03,551 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:55:03,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:03,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:03,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:03,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:55:03,681 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:03,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:55:03,700 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:03,700 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:03,701 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_2, i_6) = 1*len_2 - 1*i_6 Supporting invariants [] [2025-04-26 16:55:03,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:55:03,708 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:03,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:03,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:03,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:03,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:03,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:03,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:03,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:55:03,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:55:03,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:03,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:03,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:03,770 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 [2025-04-26 16:55:03,771 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:03,826 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (in total 37), 23 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 66 states and 111 transitions. Complement of second has 5 states. [2025-04-26 16:55:03,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-04-26 16:55:03,837 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:55:03,837 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:03,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:55:03,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:03,839 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:55:03,839 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:03,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 111 transitions. [2025-04-26 16:55:03,841 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2025-04-26 16:55:03,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 22 states and 37 transitions. [2025-04-26 16:55:03,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 16:55:03,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-04-26 16:55:03,846 INFO L74 IsDeterministic]: Start isDeterministic. Operand 22 states and 37 transitions. [2025-04-26 16:55:03,846 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:03,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 37 transitions. [2025-04-26 16:55:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 37 transitions. [2025-04-26 16:55:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2025-04-26 16:55:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (in total 28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 28 transitions. [2025-04-26 16:55:03,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 28 transitions. [2025-04-26 16:55:03,863 INFO L438 stractBuchiCegarLoop]: Abstraction has 15 states and 28 transitions. [2025-04-26 16:55:03,863 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:03,863 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 28 transitions. [2025-04-26 16:55:03,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-04-26 16:55:03,864 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:03,864 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:03,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:03,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:55:03,864 INFO L752 eck$LassoCheckResult]: Stem: "[92] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] $Ultimate##0-->L32: Formula: (and (= v_count_4_7 v_count_1_7) (= v_i_6_10 0) (not v_break_7_9)) InVars {count_4=v_count_4_7, count_1=v_count_1_7} OutVars{i_6=v_i_6_10, count_1=v_count_1_7, break_7=v_break_7_9, count_4=v_count_4_7} AuxVars[] AssignedVars[i_6, break_7]" "[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]" "[85] $Ultimate##0-->L62: Formula: (and (not v_break_10_17) (= v_i_9_14 0) (= v_count_1_11 v_count_4_11)) InVars {count_4=v_count_4_11, count_1=v_count_1_11} OutVars{break_10=v_break_10_17, count_1=v_count_1_11, count_4=v_count_4_11, i_9=v_i_9_14} AuxVars[] AssignedVars[break_10, i_9]" [2025-04-26 16:55:03,866 INFO L754 eck$LassoCheckResult]: Loop: "[88] L62-->L62: Formula: (let ((.cse3 (select v_array_0_15 v_i_9_19)) (.cse2 (select v_array_3_15 v_i_9_19)) (.cse0 (not v_break_10_22))) (and (let ((.cse1 (= .cse2 .cse3))) (or (and (not v_break_10_21) .cse0 .cse1) (and v_break_10_21 (or (not .cse1) v_break_10_22)))) (< v_i_9_19 v_len_2_15) (= v_result_11_21 (ite (< .cse2 .cse3) (- 1) (ite (< .cse3 .cse2) 1 v_result_11_22))) .cse0 (< v_i_9_19 v_len_5_15) (= (+ v_i_9_19 1) v_i_9_18))) InVars {break_10=v_break_10_22, result_11=v_result_11_22, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_15, i_9=v_i_9_19} OutVars{break_10=v_break_10_21, result_11=v_result_11_21, array_3=v_array_3_15, array_0=v_array_0_15, len_2=v_len_2_15, len_5=v_len_5_15, i_9=v_i_9_18} AuxVars[] AssignedVars[break_10, result_11, i_9]" [2025-04-26 16:55:03,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:03,867 INFO L85 PathProgramCache]: Analyzing trace with hash 3744203, now seen corresponding path program 1 times [2025-04-26 16:55:03,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:03,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703910067] [2025-04-26 16:55:03,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:03,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:03,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:03,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:03,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:03,873 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:03,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:03,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:03,879 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:03,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2025-04-26 16:55:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:03,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961026467] [2025-04-26 16:55:03,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:03,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:55:03,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:55:03,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:03,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:03,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:55:03,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:55:03,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:03,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:03,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash 116070381, now seen corresponding path program 1 times [2025-04-26 16:55:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:03,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696920551] [2025-04-26 16:55:03,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:03,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:03,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:03,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:03,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:03,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:03,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:03,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:03,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:03,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:04,079 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:04,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:04,079 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:04,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:04,079 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:04,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:04,079 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:04,079 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:04,080 INFO L132 ssoRankerPreferences]: Filename of dumped script: word-symm.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:55:04,080 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:04,080 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:04,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:04,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:04,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:04,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:04,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:04,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:04,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:04,380 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:04,381 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:04,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:04,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:04,384 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:04,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:55:04,386 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 [2025-04-26 16:55:04,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:04,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:04,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:04,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:04,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:04,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:04,402 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:04,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:55:04,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:04,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:04,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:55:04,414 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 [2025-04-26 16:55:04,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:04,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:04,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:04,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:04,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:04,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:04,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:04,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:55:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:04,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:04,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:04,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:55:04,439 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 [2025-04-26 16:55:04,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:04,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:04,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:04,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:04,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:04,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:04,456 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:04,465 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:04,465 INFO L437 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:55:04,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:04,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:04,467 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:04,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:55:04,470 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:04,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:55:04,487 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:04,487 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:04,487 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_9, len_5) = -1*i_9 + 1*len_5 Supporting invariants [] [2025-04-26 16:55:04,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:04,494 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:04,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:04,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:04,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:04,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:04,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:04,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:04,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:04,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:55:04,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:55:04,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:04,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:04,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:04,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:04,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:04,528 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 [2025-04-26 16:55:04,528 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 28 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:04,547 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 28 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 26 states and 46 transitions. Complement of second has 4 states. [2025-04-26 16:55:04,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-04-26 16:55:04,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:55:04,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:04,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:55:04,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:04,549 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:55:04,549 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:04,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 46 transitions. [2025-04-26 16:55:04,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:04,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2025-04-26 16:55:04,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:04,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:04,551 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:04,551 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:04,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:04,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:04,551 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:04,551 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:04,551 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:04,551 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:04,551 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:04,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:04,563 INFO L201 PluginConnector]: Adding new model word-symm.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:04 BoogieIcfgContainer [2025-04-26 16:55:04,563 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:04,564 INFO L158 Benchmark]: Toolchain (without parser) took 2464.64ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 89.0MB in the beginning and 95.3MB in the end (delta: -6.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:04,564 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.61ms. Allocated memory is still 163.6MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:04,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.94ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:04,564 INFO L158 Benchmark]: Boogie Preprocessor took 27.55ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 86.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:04,564 INFO L158 Benchmark]: RCFGBuilder took 232.16ms. Allocated memory is still 163.6MB. Free memory was 86.0MB in the beginning and 73.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:04,565 INFO L158 Benchmark]: BuchiAutomizer took 2162.66ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 73.2MB in the beginning and 95.3MB in the end (delta: -22.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:04,566 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.61ms. Allocated memory is still 163.6MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.94ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 87.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.55ms. Allocated memory is still 163.6MB. Free memory was 87.1MB in the beginning and 86.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 232.16ms. Allocated memory is still 163.6MB. Free memory was 86.0MB in the beginning and 73.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2162.66ms. Allocated memory was 163.6MB in the beginning and 155.2MB in the end (delta: -8.4MB). Free memory was 73.2MB in the beginning and 95.3MB in the end (delta: -22.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations. 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, 38 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 10 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital96 mio100 ax100 hnf100 lsp203 ukn38 mio100 lsp75 div100 bol108 ite100 ukn100 eq148 hnf100 smp100 dnf503 smp13 tf100 neg100 sie119 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 118, Number of transitions in reduction automaton: 37, Number of states in reduction automaton: 24, Underlying: - 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_5 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:04,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...