/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/chromosome-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:37,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:37,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:37,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:37,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:37,594 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:37,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:37,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:37,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:37,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:37,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:37,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:37,612 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:37,612 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:37,612 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:37,612 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:37,613 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:37,613 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:37,613 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:37,613 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:37,613 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:37,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:37,613 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:37,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:37,616 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:37,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:37,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:37,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:37,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:37,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:37,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:37,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:37,617 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:37,617 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:37,617 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:37,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:37,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:37,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:37,876 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:37,877 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:37,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-subst.wvr.bpl [2025-04-26 16:54:37,878 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/chromosome-subst.wvr.bpl' [2025-04-26 16:54:37,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:37,901 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:37,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:37,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:37,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:37,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,942 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:37,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:37,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:37,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:37,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:37,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,955 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,955 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:37,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:37,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:37,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:37,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/1) ... [2025-04-26 16:54:37,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:38,000 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:38,002 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:38,020 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:38,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:38,020 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:38,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:38,020 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:38,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:38,021 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:54:38,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:54:38,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:54:38,021 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:38,057 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:38,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:38,182 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:38,183 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:38,248 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:38,249 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:54:38,249 INFO L201 PluginConnector]: Adding new model chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:38 BoogieIcfgContainer [2025-04-26 16:54:38,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:38,250 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:38,250 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:38,257 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:38,257 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:38,257 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:37" (1/2) ... [2025-04-26 16:54:38,259 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56088882 and model type chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:38, skipping insertion in model container [2025-04-26 16:54:38,259 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:38,259 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:38" (2/2) ... [2025-04-26 16:54:38,260 INFO L376 chiAutomizerObserver]: Analyzing ICFG chromosome-subst.wvr.bpl [2025-04-26 16:54:38,311 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:54:38,349 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:38,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:38,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:38,354 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:38,355 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:38,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:54:38,439 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:54:38,440 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:54:38,446 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 23 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:38,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:54:38,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 16:54:38,451 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 16:54:38,457 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:38,486 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 55#[thread1EXIT, L101, L59]true [2025-04-26 16:54:38,520 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 67#[L83, thread2EXIT, thread1EXIT, L102]true [2025-04-26 16:54:38,521 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 73#[L83, L103, thread2EXIT]true [2025-04-26 16:54:38,523 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 97#[L83, thread1EXIT, L102, L59]true [2025-04-26 16:54:38,526 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105#[thread2FINAL, L83, thread1EXIT, L102]true [2025-04-26 16:54:38,527 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109#[L103, L83, thread2FINAL]true [2025-04-26 16:54:38,527 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 101#[thread3FINAL, thread1EXIT, L102, L59]true [2025-04-26 16:54:38,528 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 117#[thread3EXIT, thread1EXIT, L102, L59]true [2025-04-26 16:54:38,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119#[thread3FINAL, L103, L59]true [2025-04-26 16:54:38,531 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 103#[L103, L83, L59]true [2025-04-26 16:54:38,531 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39#[L35, L100]true [2025-04-26 16:54:38,533 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 127#[thread1FINAL, L101, L59]true [2025-04-26 16:54:38,535 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141#[thread1FINAL, L83, L102, L59]true [2025-04-26 16:54:38,536 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145#[thread2FINAL, thread1FINAL, L83, L102]true [2025-04-26 16:54:38,536 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 143#[thread3FINAL, thread1FINAL, L102, L59]true [2025-04-26 16:54:38,537 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 155#[thread1FINAL, thread3EXIT, L102, L59]true [2025-04-26 16:54:38,537 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125#[L59, L101, L35]true [2025-04-26 16:54:38,538 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131#[thread2FINAL, L101, L35]true [2025-04-26 16:54:38,539 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 161#[L101, L35, thread2EXIT]true [2025-04-26 16:54:38,541 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 149#[thread2EXIT, thread1FINAL, L83, L102]true [2025-04-26 16:54:38,541 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 167#[L83, L35, thread2EXIT, L102]true [2025-04-26 16:54:38,542 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 169#[thread3FINAL, thread2EXIT, L35, L102]true [2025-04-26 16:54:38,543 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173#[L83, thread2FINAL, L35, L102]true [2025-04-26 16:54:38,547 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[thread3FINAL, L35, thread2FINAL, L102]true [2025-04-26 16:54:38,548 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177#[thread3EXIT, thread2FINAL, L35, L102]true [2025-04-26 16:54:38,549 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179#[L83, L35, L102, L59]true [2025-04-26 16:54:38,550 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 181#[thread3FINAL, L35, L102, L59]true [2025-04-26 16:54:38,550 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 183#[thread3EXIT, L35, L102, L59]true [2025-04-26 16:54:38,551 WARN L140 AmpleReduction]: Number of pruned transitions: 45 [2025-04-26 16:54:38,551 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 28 [2025-04-26 16:54:38,551 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 28 [2025-04-26 16:54:38,551 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 16:54:38,551 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:49 [2025-04-26 16:54:38,551 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:54:38,551 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:54:38,551 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:38,554 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:38,559 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:38,559 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:38,559 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:38,559 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:38,560 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:38,560 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:38,560 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:38,560 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:38,561 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:38,572 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 16:54:38,572 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:38,572 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:38,575 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:38,576 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:38,576 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:38,577 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:38,582 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 16:54:38,582 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:38,582 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:38,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:54:38,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:38,586 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L35: Formula: (and (not v_isNull_1_3) (or (and (not v_break_6_8) (not v_isNull_3_5)) (and v_break_6_8 v_isNull_3_5)) (= v_result_7_11 1) (= v_i_8_11 0)) InVars {isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5, i_8=v_i_8_11, result_7=v_result_7_11, break_6=v_break_6_8} AuxVars[] AssignedVars[result_7, break_6, i_8]" [2025-04-26 16:54:38,587 INFO L754 eck$LassoCheckResult]: Loop: "[106] L35-->L35: Formula: (and (let ((.cse0 (= v_result_7_23 0))) (or (and (not v_break_6_18) .cse0) (and (not .cse0) v_break_6_18))) (< v_i_8_28 5) (= (select v_o_0_7 v_i_8_28) (+ v_result_7_23 (select v_o_2_7 v_i_8_28))) (= v_i_8_27 (+ v_i_8_28 1)) (not v_break_6_19)) InVars {o_0=v_o_0_7, o_2=v_o_2_7, i_8=v_i_8_28, break_6=v_break_6_19} OutVars{o_0=v_o_0_7, o_2=v_o_2_7, i_8=v_i_8_27, break_6=v_break_6_18, result_7=v_result_7_23} AuxVars[] AssignedVars[break_6, result_7, i_8]" [2025-04-26 16:54:38,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash 4723, now seen corresponding path program 1 times [2025-04-26 16:54:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:38,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182076205] [2025-04-26 16:54:38,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:38,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:38,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:38,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:38,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:38,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:38,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:38,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:38,673 INFO L85 PathProgramCache]: Analyzing trace with hash 137, now seen corresponding path program 1 times [2025-04-26 16:54:38,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:38,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698919627] [2025-04-26 16:54:38,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:38,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:38,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:38,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:38,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,682 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:38,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:38,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:38,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:38,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 146519, now seen corresponding path program 1 times [2025-04-26 16:54:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:38,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432889943] [2025-04-26 16:54:38,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:38,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:38,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:38,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:38,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:38,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:38,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:38,887 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:38,887 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:38,887 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:38,887 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:38,888 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:38,888 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:38,888 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:38,888 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:38,888 INFO L132 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:38,888 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:38,888 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:38,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:38,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:38,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,198 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:39,201 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,205 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:39,207 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:39,208 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:39,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,230 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:39,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:39,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,239 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:39,240 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:39,242 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:39,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,253 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:39,253 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:54:39,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,281 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2025-04-26 16:54:39,281 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:54:39,320 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:39,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:39,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,329 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:39,331 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:39,333 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:39,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,352 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:39,362 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:39,362 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:54:39,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,365 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:39,368 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:39,372 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:39,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:39,386 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:39,386 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:39,387 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_8) = -2*i_8 + 9 Supporting invariants [] [2025-04-26 16:54:39,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:39,395 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:39,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:39,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:54:39,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:54:39,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:39,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:39,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:39,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:39,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:39,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:39,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:39,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:39,454 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:39,472 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:39,474 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:39,527 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:39,531 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:39,534 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:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 16:54:39,537 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 16:54:39,537 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:39,537 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 16:54:39,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:39,538 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:54:39,538 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:39,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 409 transitions. [2025-04-26 16:54:39,544 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 16:54:39,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 83 states and 205 transitions. [2025-04-26 16:54:39,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 16:54:39,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 16:54:39,555 INFO L74 IsDeterministic]: Start isDeterministic. Operand 83 states and 205 transitions. [2025-04-26 16:54:39,555 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:39,555 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 205 transitions. [2025-04-26 16:54:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 205 transitions. [2025-04-26 16:54:39,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-04-26 16:54:39,580 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:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 164 transitions. [2025-04-26 16:54:39,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 16:54:39,581 INFO L438 stractBuchiCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 16:54:39,581 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:39,581 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 164 transitions. [2025-04-26 16:54:39,582 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 16:54:39,583 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:39,583 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:39,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:39,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:39,583 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L35: Formula: (and (not v_isNull_1_3) (or (and (not v_break_6_8) (not v_isNull_3_5)) (and v_break_6_8 v_isNull_3_5)) (= v_result_7_11 1) (= v_i_8_11 0)) InVars {isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5, i_8=v_i_8_11, result_7=v_result_7_11, break_6=v_break_6_8} AuxVars[] AssignedVars[result_7, break_6, i_8]" "[121] L100-->$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]" "[108] $Ultimate##0-->L59: Formula: (and (= v_result_10_19 1) (or (and (not v_break_9_18) (not v_isNull_5_5)) (and v_break_9_18 v_isNull_5_5)) (= v_i_11_27 0) (not v_isNull_1_5)) InVars {isNull_5=v_isNull_5_5, isNull_1=v_isNull_1_5} OutVars{isNull_5=v_isNull_5_5, i_11=v_i_11_27, break_9=v_break_9_18, isNull_1=v_isNull_1_5, result_10=v_result_10_19} AuxVars[] AssignedVars[break_9, i_11, result_10]" [2025-04-26 16:54:39,583 INFO L754 eck$LassoCheckResult]: Loop: "[109] L59-->L59: Formula: (and (< v_i_11_20 5) (= (+ v_result_10_13 (select v_o_4_7 v_i_11_20)) (select v_o_0_13 v_i_11_20)) (let ((.cse0 (= v_result_10_13 0))) (or (and (not v_break_9_12) .cse0) (and (not .cse0) v_break_9_12))) (= (+ v_i_11_20 1) v_i_11_19) (not v_break_9_13)) InVars {i_11=v_i_11_20, o_0=v_o_0_13, break_9=v_break_9_13, o_4=v_o_4_7} OutVars{i_11=v_i_11_19, o_0=v_o_0_13, break_9=v_break_9_12, result_10=v_result_10_13, o_4=v_o_4_7} AuxVars[] AssignedVars[break_9, i_11, result_10]" [2025-04-26 16:54:39,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash 4542662, now seen corresponding path program 1 times [2025-04-26 16:54:39,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:39,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896093446] [2025-04-26 16:54:39,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:39,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:39,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:39,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:39,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:39,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:39,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2025-04-26 16:54:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:39,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13801766] [2025-04-26 16:54:39,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:39,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:39,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:39,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:39,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:39,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:39,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:39,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:39,601 INFO L85 PathProgramCache]: Analyzing trace with hash 140822631, now seen corresponding path program 1 times [2025-04-26 16:54:39,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:39,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533757015] [2025-04-26 16:54:39,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:39,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:39,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:39,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:39,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:39,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:39,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:39,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:39,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:39,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:39,793 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:39,793 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:39,793 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:39,793 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:39,793 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:39,793 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,793 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:39,793 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:39,793 INFO L132 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:39,793 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:39,794 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:39,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,069 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:40,069 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:40,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,073 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:40,074 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:40,075 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:40,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:40,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:40,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:40,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:40,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,101 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:40,102 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:40,104 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:40,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,114 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:40,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,116 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-04-26 16:54:40,117 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,120 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:40,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:54:40,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,128 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:40,128 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:40,131 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:40,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:40,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:40,144 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,146 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:40,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:40,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,155 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:40,158 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:40,159 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:40,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:40,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:40,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,175 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:40,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:54:40,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,184 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:40,185 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:40,187 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:40,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:40,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:40,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,202 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:40,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:54:40,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,212 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:40,214 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:40,216 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:40,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:40,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:40,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,231 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:40,236 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 16:54:40,236 INFO L437 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:54:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,238 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:40,239 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:40,240 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:40,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:40,258 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:40,258 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:40,258 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_11) = -2*i_11 + 9 Supporting invariants [] [2025-04-26 16:54:40,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:40,265 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:40,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:40,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:40,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:40,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:40,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,296 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:40,297 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:40,297 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:40,336 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:40,337 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:40,338 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:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 16:54:40,338 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 16:54:40,338 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,338 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 16:54:40,338 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,338 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:54:40,338 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 468 transitions. [2025-04-26 16:54:40,344 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 16:54:40,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 91 states and 232 transitions. [2025-04-26 16:54:40,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 16:54:40,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 16:54:40,345 INFO L74 IsDeterministic]: Start isDeterministic. Operand 91 states and 232 transitions. [2025-04-26 16:54:40,346 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:40,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 232 transitions. [2025-04-26 16:54:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 232 transitions. [2025-04-26 16:54:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-04-26 16:54:40,352 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:40,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 206 transitions. [2025-04-26 16:54:40,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 16:54:40,356 INFO L438 stractBuchiCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 16:54:40,356 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:40,356 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 206 transitions. [2025-04-26 16:54:40,357 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 16:54:40,357 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:40,357 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:40,357 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:40,357 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:54:40,358 INFO L752 eck$LassoCheckResult]: Stem: "[118] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] $Ultimate##0-->L35: Formula: (and (not v_isNull_1_3) (or (and (not v_break_6_8) (not v_isNull_3_5)) (and v_break_6_8 v_isNull_3_5)) (= v_result_7_11 1) (= v_i_8_11 0)) InVars {isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5} OutVars{isNull_1=v_isNull_1_3, isNull_3=v_isNull_3_5, i_8=v_i_8_11, result_7=v_result_7_11, break_6=v_break_6_8} AuxVars[] AssignedVars[result_7, break_6, i_8]" "[121] L100-->$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]" "[108] $Ultimate##0-->L59: Formula: (and (= v_result_10_19 1) (or (and (not v_break_9_18) (not v_isNull_5_5)) (and v_break_9_18 v_isNull_5_5)) (= v_i_11_27 0) (not v_isNull_1_5)) InVars {isNull_5=v_isNull_5_5, isNull_1=v_isNull_1_5} OutVars{isNull_5=v_isNull_5_5, i_11=v_i_11_27, break_9=v_break_9_18, isNull_1=v_isNull_1_5, result_10=v_result_10_19} AuxVars[] AssignedVars[break_9, i_11, result_10]" "[124] L101-->$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]" "[112] $Ultimate##0-->L83: Formula: (and (= v_result_13_23 1) (not v_isNull_3_7) (or (and (not v_break_12_20) (not v_isNull_5_9)) (and v_isNull_5_9 v_break_12_20)) (= v_i_14_29 0)) InVars {isNull_5=v_isNull_5_9, isNull_3=v_isNull_3_7} OutVars{isNull_5=v_isNull_5_9, result_13=v_result_13_23, break_12=v_break_12_20, i_14=v_i_14_29, isNull_3=v_isNull_3_7} AuxVars[] AssignedVars[result_13, break_12, i_14]" [2025-04-26 16:54:40,358 INFO L754 eck$LassoCheckResult]: Loop: "[114] L83-->L83: Formula: (and (= (select v_o_2_13 v_i_14_22) (+ v_result_13_17 (select v_o_4_13 v_i_14_22))) (let ((.cse0 (= v_result_13_17 0))) (or (and v_break_12_14 (not .cse0)) (and .cse0 (not v_break_12_14)))) (not v_break_12_15) (< v_i_14_22 5) (= (+ v_i_14_22 1) v_i_14_21)) InVars {break_12=v_break_12_15, i_14=v_i_14_22, o_2=v_o_2_13, o_4=v_o_4_13} OutVars{break_12=v_break_12_14, result_13=v_result_13_17, i_14=v_i_14_21, o_2=v_o_2_13, o_4=v_o_4_13} AuxVars[] AssignedVars[break_12, result_13, i_14]" [2025-04-26 16:54:40,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 70534842, now seen corresponding path program 1 times [2025-04-26 16:54:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:40,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705484298] [2025-04-26 16:54:40,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:40,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:40,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:40,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:40,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:40,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:40,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:40,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,374 INFO L85 PathProgramCache]: Analyzing trace with hash 145, now seen corresponding path program 1 times [2025-04-26 16:54:40,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:40,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627159062] [2025-04-26 16:54:40,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:40,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:40,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:40,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:40,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:40,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:40,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:40,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash -2108387080, now seen corresponding path program 1 times [2025-04-26 16:54:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:40,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236758068] [2025-04-26 16:54:40,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:40,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:40,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:40,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:40,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:40,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:40,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:40,640 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:40,641 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:40,641 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:40,641 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:40,641 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:40,641 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,641 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:40,641 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:40,641 INFO L132 ssoRankerPreferences]: Filename of dumped script: chromosome-subst.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:40,641 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:40,641 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:40,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:40,891 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:40,891 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:40,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,893 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:40,895 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:40,896 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:40,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:40,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:40,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,910 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:40,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:40,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,920 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:40,921 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:40,922 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:40,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:40,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:40,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:40,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:40,933 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:40,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:40,937 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:40,944 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:40,945 INFO L437 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:40,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,947 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:40,948 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:40,948 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:40,965 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:40,965 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:40,965 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:40,965 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_14) = -2*i_14 + 9 Supporting invariants [] [2025-04-26 16:54:40,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:54:40,972 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:40,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:41,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:41,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:54:41,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:54:41,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,029 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:41,029 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:41,030 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:41,068 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:41,068 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:41,068 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:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 16:54:41,069 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 16:54:41,069 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,069 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 16:54:41,069 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,069 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:54:41,069 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 380 transitions. [2025-04-26 16:54:41,071 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:41,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-04-26 16:54:41,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:41,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:41,071 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:41,071 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:41,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:41,072 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:41,072 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:41,072 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:41,072 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:41,072 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:41,072 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:41,084 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:41,085 INFO L201 PluginConnector]: Adding new model chromosome-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:41 BoogieIcfgContainer [2025-04-26 16:54:41,085 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:41,086 INFO L158 Benchmark]: Toolchain (without parser) took 3185.30ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 84.9MB in the beginning and 104.9MB in the end (delta: -20.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:41,086 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:41,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.02ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:41,087 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:41,087 INFO L158 Benchmark]: RCFGBuilder took 273.75ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 67.7MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:41,087 INFO L158 Benchmark]: BuchiAutomizer took 2835.37ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 67.6MB in the beginning and 104.9MB in the end (delta: -37.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:41,088 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.02ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 273.75ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 67.7MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2835.37ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 67.6MB in the beginning and 104.9MB in the end (delta: -37.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. 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, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75 IncrementalHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 75 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital74 mio100 ax100 hnf100 lsp69 ukn91 mio100 lsp75 div100 bol134 ite100 ukn100 eq139 hnf96 smp100 dnf300 smp49 tf100 neg100 sie117 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 83ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 207, 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 9 + -2 * i_8 and consists of 4 locations. One deterministic module has affine ranking function -2 * i_11 + 9 and consists of 3 locations. One deterministic module has affine ranking function 9 + -2 * i_14 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:41,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...