/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/array-int-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:31,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:31,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:31,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:31,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:31,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:31,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:31,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:31,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:31,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:31,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:31,982 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:31,982 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:31,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:31,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:31,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:31,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:31,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:31,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:31,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:31,984 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:31,984 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:31,984 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:32,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:32,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:32,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:32,247 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:32,248 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:32,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl [2025-04-26 16:54:32,251 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-subst.wvr.bpl' [2025-04-26 16:54:32,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:32,276 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:32,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:32,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:32,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:32,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,315 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:32,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:32,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:32,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:32,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:32,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,332 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:32,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:32,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:32,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:32,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/1) ... [2025-04-26 16:54:32,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:32,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,380 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:54:32,384 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:54:32,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:32,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:32,406 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:32,406 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:32,406 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:32,406 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:32,407 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:54:32,448 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:32,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:32,585 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:32,586 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:32,637 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:32,637 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:54:32,638 INFO L201 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:32 BoogieIcfgContainer [2025-04-26 16:54:32,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:32,638 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:32,640 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:32,644 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:32,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:32,645 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:32" (1/2) ... [2025-04-26 16:54:32,647 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1359f399 and model type array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:32, skipping insertion in model container [2025-04-26 16:54:32,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:32,647 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:32" (2/2) ... [2025-04-26 16:54:32,648 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-int-subst.wvr.bpl [2025-04-26 16:54:32,709 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:54:32,753 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:32,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:32,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,757 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:54:32,759 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:54:32,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:54:32,841 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:54:32,843 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:54:32,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:54:32,846 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:54:32,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 16:54:32,849 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 16:54:32,855 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:32,911 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69#[L72, thread1EXIT, L87, thread2EXIT]true [2025-04-26 16:54:32,912 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 71#[thread2EXIT, L72, L88]true [2025-04-26 16:54:32,912 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55#[L53, thread1EXIT, L86]true [2025-04-26 16:54:32,918 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 103#[thread2FINAL, L72, thread1EXIT, L87]true [2025-04-26 16:54:32,921 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 107#[thread2FINAL, L72, L88]true [2025-04-26 16:54:32,922 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 99#[L72, L53, thread1EXIT, L87]true [2025-04-26 16:54:32,923 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105#[L53, thread1EXIT, L87, thread3FINAL]true [2025-04-26 16:54:32,927 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 117#[thread3EXIT, L53, thread1EXIT, L87]true [2025-04-26 16:54:32,929 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119#[thread3FINAL, L53, L88]true [2025-04-26 16:54:32,929 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 101#[L53, L72, L88]true [2025-04-26 16:54:32,929 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39#[L85, L34]true [2025-04-26 16:54:32,934 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 127#[thread1FINAL, L53, L86]true [2025-04-26 16:54:32,940 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 143#[thread2FINAL, thread1FINAL, L72, L87]true [2025-04-26 16:54:32,940 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141#[thread1FINAL, L72, L53, L87]true [2025-04-26 16:54:32,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145#[thread1FINAL, L53, L87, thread3FINAL]true [2025-04-26 16:54:32,942 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 155#[thread1FINAL, thread3EXIT, L53, L87]true [2025-04-26 16:54:32,942 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125#[L53, L86, L34]true [2025-04-26 16:54:32,942 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131#[L34, thread2FINAL, L86]true [2025-04-26 16:54:32,943 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161#[thread2EXIT, L86, L34]true [2025-04-26 16:54:32,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147#[thread1FINAL, L72, L87, thread2EXIT]true [2025-04-26 16:54:32,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 167#[L34, L72, L87, thread2EXIT]true [2025-04-26 16:54:32,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 169#[L34, L87, thread3FINAL, thread2EXIT]true [2025-04-26 16:54:32,951 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173#[thread2FINAL, L34, L72, L87]true [2025-04-26 16:54:32,952 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[thread2FINAL, L34, L87, thread3FINAL]true [2025-04-26 16:54:32,952 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177#[thread2FINAL, L34, thread3EXIT, L87]true [2025-04-26 16:54:32,956 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179#[L34, L72, L53, L87]true [2025-04-26 16:54:32,957 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 181#[L34, L53, L87, thread3FINAL]true [2025-04-26 16:54:32,958 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 183#[L34, thread3EXIT, L53, L87]true [2025-04-26 16:54:32,958 WARN L140 AmpleReduction]: Number of pruned transitions: 45 [2025-04-26 16:54:32,958 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 28 [2025-04-26 16:54:32,958 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 28 [2025-04-26 16:54:32,958 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 16:54:32,958 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:49 [2025-04-26 16:54:32,958 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:54:32,958 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:32,958 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:32,960 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:54:32,970 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:32,970 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:32,970 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:32,970 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:32,970 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:32,970 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:32,970 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:32,971 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:32,973 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:54:32,992 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 16:54:32,992 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:32,993 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:32,998 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:32,999 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:32,999 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:33,000 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:54:33,007 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 16:54:33,007 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:33,007 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:33,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:33,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:33,014 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_7) (= v_len_1_9 (+ v_result_8_7 v_len_3_9)) (= v_i_6_8 0)) InVars {len_1=v_len_1_9, len_3=v_len_3_9} OutVars{result_8=v_result_8_7, i_6=v_i_6_8, len_1=v_len_1_9, len_3=v_len_3_9, break_7=v_break_7_7} AuxVars[] AssignedVars[result_8, i_6, break_7]" [2025-04-26 16:54:33,018 INFO L754 eck$LassoCheckResult]: Loop: "[88] L34-->L34: Formula: (let ((.cse1 (select v_array_2_9 v_i_6_16)) (.cse2 (select v_array_0_9 v_i_6_16))) (let ((.cse0 (= .cse1 .cse2))) (and (or (and (not v_break_7_13) .cse0) (and (not .cse0) v_break_7_13)) (not v_break_7_14) (< v_i_6_17 v_len_1_11) (= v_result_8_17 (ite .cse0 v_result_8_18 (+ (* (- 1) .cse1) .cse2))) (< v_i_6_17 v_len_3_11) (= v_i_6_16 (+ v_i_6_17 1))))) InVars {result_8=v_result_8_18, i_6=v_i_6_17, len_1=v_len_1_11, array_2=v_array_2_9, len_3=v_len_3_11, break_7=v_break_7_14, array_0=v_array_0_9} OutVars{result_8=v_result_8_17, i_6=v_i_6_16, len_1=v_len_1_11, array_2=v_array_2_9, break_7=v_break_7_13, len_3=v_len_3_11, array_0=v_array_0_9} AuxVars[] AssignedVars[result_8, i_6, break_7]" [2025-04-26 16:54:33,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash 4147, now seen corresponding path program 1 times [2025-04-26 16:54:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713424032] [2025-04-26 16:54:33,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:33,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:33,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:33,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:33,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2025-04-26 16:54:33,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709710845] [2025-04-26 16:54:33,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:33,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:33,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:33,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,149 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:33,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:33,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,163 INFO L85 PathProgramCache]: Analyzing trace with hash 128645, now seen corresponding path program 1 times [2025-04-26 16:54:33,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98001015] [2025-04-26 16:54:33,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:33,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:33,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,174 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:33,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:33,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,442 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:33,444 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:33,444 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:33,444 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:33,445 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:33,445 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,445 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:33,445 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:33,445 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:33,445 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:33,446 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:33,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:33,786 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:33,790 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:33,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,794 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:54:33,795 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:54:33,796 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:54:33,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:33,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:33,809 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:54:33,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:33,852 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:54:33,853 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:54:33,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:33,954 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:54:33,954 INFO L437 ModelExtractionUtils]: 48 out of 57 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:54:33,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:33,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:33,959 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:54:33,960 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:54:33,960 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:33,982 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:54:33,982 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:54:33,983 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:33,983 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_6, len_1) = -1*i_6 + 1*len_1 Supporting invariants [] [2025-04-26 16:54:33,991 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:54:33,993 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:34,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:34,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:34,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:34,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:34,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:34,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:34,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:34,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:34,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:34,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:34,033 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:54:34,050 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:54:34,052 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:54:34,139 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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 167 states and 409 transitions. Complement of second has 5 states. [2025-04-26 16:54:34,142 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:54:34,146 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:54:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 16:54:34,154 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:54:34,155 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:34,155 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:34,155 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:34,155 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:34,155 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:34,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 409 transitions. [2025-04-26 16:54:34,164 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 16:54:34,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 83 states and 205 transitions. [2025-04-26 16:54:34,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 16:54:34,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 16:54:34,174 INFO L74 IsDeterministic]: Start isDeterministic. Operand 83 states and 205 transitions. [2025-04-26 16:54:34,174 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:34,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 205 transitions. [2025-04-26 16:54:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 205 transitions. [2025-04-26 16:54:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-04-26 16:54:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.5625) internal successors, (in total 164), 63 states have internal predecessors, (164), 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:54:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 164 transitions. [2025-04-26 16:54:34,199 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 16:54:34,199 INFO L438 stractBuchiCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 16:54:34,199 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:34,199 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 164 transitions. [2025-04-26 16:54:34,202 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 16:54:34,202 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:34,202 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:34,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:34,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:34,203 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_7) (= v_len_1_9 (+ v_result_8_7 v_len_3_9)) (= v_i_6_8 0)) InVars {len_1=v_len_1_9, len_3=v_len_3_9} OutVars{result_8=v_result_8_7, i_6=v_i_6_8, len_1=v_len_1_9, len_3=v_len_3_9, break_7=v_break_7_7} AuxVars[] AssignedVars[result_8, i_6, break_7]" "[103] 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]" "[90] $Ultimate##0-->L53: Formula: (and (not v_break_10_15) (= (+ v_result_11_19 v_len_5_11) v_len_1_17) (= v_i_9_18 0)) InVars {len_1=v_len_1_17, len_5=v_len_5_11} OutVars{len_5=v_len_5_11, result_11=v_result_11_19, break_10=v_break_10_15, len_1=v_len_1_17, i_9=v_i_9_18} AuxVars[] AssignedVars[result_11, break_10, i_9]" [2025-04-26 16:54:34,203 INFO L754 eck$LassoCheckResult]: Loop: "[92] L53-->L53: Formula: (let ((.cse1 (select v_array_0_15 v_i_9_14)) (.cse2 (select v_array_4_9 v_i_9_14))) (let ((.cse0 (= .cse1 .cse2))) (and (or (and (not .cse0) v_break_10_9) (and .cse0 (not v_break_10_9))) (< v_i_9_15 v_len_5_7) (not v_break_10_10) (= (+ v_i_9_15 1) v_i_9_14) (= v_result_11_13 (ite .cse0 v_result_11_14 (+ .cse1 (* (- 1) .cse2)))) (< v_i_9_15 v_len_1_13)))) InVars {result_11=v_result_11_14, break_10=v_break_10_10, array_4=v_array_4_9, len_1=v_len_1_13, array_0=v_array_0_15, len_5=v_len_5_7, i_9=v_i_9_15} OutVars{result_11=v_result_11_13, break_10=v_break_10_9, array_4=v_array_4_9, len_1=v_len_1_13, array_0=v_array_0_15, len_5=v_len_5_7, i_9=v_i_9_14} AuxVars[] AssignedVars[result_11, break_10, i_9]" [2025-04-26 16:54:34,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash 3988550, now seen corresponding path program 1 times [2025-04-26 16:54:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336199111] [2025-04-26 16:54:34,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:34,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:34,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:34,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:34,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:34,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,215 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 1 times [2025-04-26 16:54:34,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740015516] [2025-04-26 16:54:34,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:34,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:34,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:34,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:34,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 123645142, now seen corresponding path program 1 times [2025-04-26 16:54:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605148440] [2025-04-26 16:54:34,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:34,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:34,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:34,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:34,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,450 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:34,451 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:34,451 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:34,451 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:34,451 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:34,451 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,451 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:34,451 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:34,451 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:34,451 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:34,451 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:34,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,787 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:34,787 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:34,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,789 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:54:34,795 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:54:34,796 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:54:34,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:34,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:34,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:34,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:34,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:34,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:34,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:34,815 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:54:34,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,818 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:54:34,819 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:54:34,825 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:54:34,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:34,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:34,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:34,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:34,837 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:34,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:34,839 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:34,845 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:54:34,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,848 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:54:34,849 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:54:34,850 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:54:34,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:34,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:34,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:34,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:34,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:34,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:34,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:34,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:34,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:34,872 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:54:34,873 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:54:34,875 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:54:34,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:34,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:34,885 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:54:34,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:34,917 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:54:34,917 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:54:34,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:35,031 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:54:35,032 INFO L437 ModelExtractionUtils]: 61 out of 71 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:35,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,034 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:54:35,037 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:54:35,037 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:35,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:35,062 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:54:35,063 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:35,063 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_1, i_9) = 1*len_1 - 1*i_9 Supporting invariants [] [2025-04-26 16:54:35,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:35,073 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:35,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:35,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:35,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:35,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:35,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:35,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:35,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:35,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:35,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:35,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:35,116 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:54:35,116 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:54:35,116 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133 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:54:35,148 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133. 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 177 states and 468 transitions. Complement of second has 4 states. [2025-04-26 16:54:35,148 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:54:35,149 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:54:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 16:54:35,149 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:54:35,149 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:35,149 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:54:35,149 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:35,149 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:35,149 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:35,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 468 transitions. [2025-04-26 16:54:35,153 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 16:54:35,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 91 states and 232 transitions. [2025-04-26 16:54:35,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 16:54:35,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 16:54:35,155 INFO L74 IsDeterministic]: Start isDeterministic. Operand 91 states and 232 transitions. [2025-04-26 16:54:35,155 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:35,155 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 232 transitions. [2025-04-26 16:54:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 232 transitions. [2025-04-26 16:54:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-04-26 16:54:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.675324675324675) internal successors, (in total 206), 76 states have internal predecessors, (206), 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:54:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 206 transitions. [2025-04-26 16:54:35,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 16:54:35,160 INFO L438 stractBuchiCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 16:54:35,160 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:35,160 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 206 transitions. [2025-04-26 16:54:35,161 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 16:54:35,161 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:35,161 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:35,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:35,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:35,162 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_7) (= v_len_1_9 (+ v_result_8_7 v_len_3_9)) (= v_i_6_8 0)) InVars {len_1=v_len_1_9, len_3=v_len_3_9} OutVars{result_8=v_result_8_7, i_6=v_i_6_8, len_1=v_len_1_9, len_3=v_len_3_9, break_7=v_break_7_7} AuxVars[] AssignedVars[result_8, i_6, break_7]" "[103] 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]" "[90] $Ultimate##0-->L53: Formula: (and (not v_break_10_15) (= (+ v_result_11_19 v_len_5_11) v_len_1_17) (= v_i_9_18 0)) InVars {len_1=v_len_1_17, len_5=v_len_5_11} OutVars{len_5=v_len_5_11, result_11=v_result_11_19, break_10=v_break_10_15, len_1=v_len_1_17, i_9=v_i_9_18} AuxVars[] AssignedVars[result_11, break_10, i_9]" "[106] L86-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[94] $Ultimate##0-->L72: Formula: (and (= v_i_12_18 0) (= v_len_3_17 (+ v_result_14_19 v_len_5_17)) (not v_break_13_15)) InVars {len_5=v_len_5_17, len_3=v_len_3_17} OutVars{len_5=v_len_5_17, i_12=v_i_12_18, result_14=v_result_14_19, break_13=v_break_13_15, len_3=v_len_3_17} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 16:54:35,162 INFO L754 eck$LassoCheckResult]: Loop: "[96] L72-->L72: Formula: (let ((.cse1 (select v_array_4_15 v_i_12_14)) (.cse2 (select v_array_2_15 v_i_12_14))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_12_15 v_len_5_13) (= (ite .cse0 v_result_14_14 (+ (* (- 1) .cse1) .cse2)) v_result_14_13) (< v_i_12_15 v_len_3_13) (not v_break_13_10) (= (+ v_i_12_15 1) v_i_12_14) (or (and (not .cse0) v_break_13_9) (and (not v_break_13_9) .cse0))))) InVars {result_14=v_result_14_14, array_4=v_array_4_15, array_2=v_array_2_15, len_3=v_len_3_13, len_5=v_len_5_13, i_12=v_i_12_15, break_13=v_break_13_10} OutVars{result_14=v_result_14_13, array_4=v_array_4_15, array_2=v_array_2_15, len_3=v_len_3_13, len_5=v_len_5_13, i_12=v_i_12_14, break_13=v_break_13_9} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 16:54:35,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -461967366, now seen corresponding path program 1 times [2025-04-26 16:54:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:35,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899973146] [2025-04-26 16:54:35,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:35,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:35,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:35,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:35,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:35,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:35,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash 127, now seen corresponding path program 1 times [2025-04-26 16:54:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:35,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697758318] [2025-04-26 16:54:35,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:35,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:35,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:35,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:35,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:35,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:35,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:35,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1436086362, now seen corresponding path program 1 times [2025-04-26 16:54:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:35,184 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045971184] [2025-04-26 16:54:35,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:35,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:35,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:35,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:35,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:35,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:35,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:35,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:35,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:35,361 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:35,361 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:35,361 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:35,361 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:35,361 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:35,361 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,361 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:35,361 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:35,361 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-subst.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:35,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:35,361 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:35,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,377 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,607 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:35,607 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:35,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,609 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:54:35,610 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:54:35,611 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:54:35,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,624 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:35,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,632 INFO L229 MonitoredProcess]: Starting monitored process 11 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:54:35,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:54:35,637 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:54:35,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,650 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:35,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,658 INFO L229 MonitoredProcess]: Starting monitored process 12 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:54:35,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:54:35,661 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:54:35,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,674 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:54:35,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,682 INFO L229 MonitoredProcess]: Starting monitored process 13 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:54:35,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:54:35,684 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:54:35,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,697 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:54:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,704 INFO L229 MonitoredProcess]: Starting monitored process 14 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:54:35,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:54:35,705 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:54:35,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,719 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:54:35,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,731 INFO L229 MonitoredProcess]: Starting monitored process 15 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:54:35,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:54:35,734 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:54:35,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,748 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:35,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,756 INFO L229 MonitoredProcess]: Starting monitored process 16 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:54:35,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:35,778 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:54:35,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,791 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:54:35,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,800 INFO L229 MonitoredProcess]: Starting monitored process 17 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:54:35,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:54:35,802 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:54:35,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,814 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:35,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,821 INFO L229 MonitoredProcess]: Starting monitored process 18 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:54:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:54:35,824 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:54:35,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,834 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:54:35,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,856 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:54:35,856 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:54:35,911 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:35,957 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:54:35,957 INFO L437 ModelExtractionUtils]: 68 out of 78 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,959 INFO L229 MonitoredProcess]: Starting monitored process 19 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:54:35,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:35,962 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:35,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:54:35,983 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 16:54:35,983 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:35,983 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_3, i_12) = 1*len_3 - 1*i_12 Supporting invariants [] [2025-04-26 16:54:35,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:35,991 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:36,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:36,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:36,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:36,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:36,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:36,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:36,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:36,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:36,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:36,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:36,026 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:54:36,027 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:54:36,027 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 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:54:36,061 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 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 148 states and 380 transitions. Complement of second has 4 states. [2025-04-26 16:54:36,062 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:54:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 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:54:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 16:54:36,063 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 16:54:36,063 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:36,063 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 16:54:36,063 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:36,063 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:54:36,063 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:36,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 380 transitions. [2025-04-26 16:54:36,067 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:36,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-04-26 16:54:36,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:36,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:36,067 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:36,067 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:36,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:36,068 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:36,068 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:36,068 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:36,068 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:36,068 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:36,068 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:36,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:36,079 INFO L201 PluginConnector]: Adding new model array-int-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:36 BoogieIcfgContainer [2025-04-26 16:54:36,079 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:36,080 INFO L158 Benchmark]: Toolchain (without parser) took 3804.98ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 93.7MB in the end (delta: -10.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:36,080 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.82ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 84.1MB in the end (delta: 105.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:36,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.92ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:36,080 INFO L158 Benchmark]: Boogie Preprocessor took 30.22ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:36,080 INFO L158 Benchmark]: RCFGBuilder took 287.32ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 67.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:36,081 INFO L158 Benchmark]: BuchiAutomizer took 3440.78ms. Allocated memory is still 155.2MB. Free memory was 67.2MB in the beginning and 93.7MB in the end (delta: -26.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:36,081 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.82ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 84.1MB in the end (delta: 105.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.92ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 81.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.22ms. Allocated memory is still 155.2MB. Free memory was 81.1MB in the beginning and 80.1MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 287.32ms. Allocated memory is still 155.2MB. Free memory was 79.9MB in the beginning and 67.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3440.78ms. Allocated memory is still 155.2MB. Free memory was 67.2MB in the beginning and 93.7MB in the end (delta: -26.6MB). 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 3.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 18 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax100 hnf100 lsp97 ukn65 mio100 lsp100 div100 bol107 ite100 ukn100 eq170 hnf96 smp100 dnf234 smp57 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 192ms VariablesStem: 5 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 212, Number of transitions in reduction automaton: 138, Number of states in reduction automaton: 66, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len_1 + -1 * i_6 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_9 + len_1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i_12 + len_3 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:54:36,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...