/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 /storage/cav23-termute-examples/4_plus_thr/interleaved6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:39,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:39,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:39,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:39,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:39,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:39,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:39,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:39,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:39,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:39,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:39,482 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:39,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:39,482 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:39,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:39,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:39,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:39,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:39,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:39,485 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:39,485 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:39,485 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:39,485 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:39,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:39,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:39,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:39,714 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:39,715 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:39,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/interleaved6.c.bpl [2025-04-26 16:58:39,717 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/interleaved6.c.bpl' [2025-04-26 16:58:39,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:39,732 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:39,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:39,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:39,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:39,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,764 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:39,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:39,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:39,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:39,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:39,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:39,790 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:39,790 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:39,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:39,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/1) ... [2025-04-26 16:58:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:39,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:39,816 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:58:39,818 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:58:39,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:39,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:39,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:39,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:39,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:39,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:39,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:39,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:39,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:39,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:39,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:39,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:39,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:39,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:58:39,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:58:39,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:58:39,845 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:58:39,886 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:39,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:39,996 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:39,996 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:40,008 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:40,008 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:40,009 INFO L201 PluginConnector]: Adding new model interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:40 BoogieIcfgContainer [2025-04-26 16:58:40,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:40,009 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:40,009 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:40,014 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:40,015 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:40,015 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:39" (1/2) ... [2025-04-26 16:58:40,016 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5de17954 and model type interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:40, skipping insertion in model container [2025-04-26 16:58:40,016 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:40,016 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:40" (2/2) ... [2025-04-26 16:58:40,017 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved6.c.bpl [2025-04-26 16:58:40,084 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:58:40,125 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:40,128 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:58:40,129 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:58:40,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 62 transitions, 166 flow [2025-04-26 16:58:40,205 INFO L116 PetriNetUnfolderBase]: 6/50 cut-off events. [2025-04-26 16:58:40,206 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:58:40,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 50 events. 6/50 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 136 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-04-26 16:58:40,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 62 transitions, 166 flow [2025-04-26 16:58:40,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 50 transitions, 136 flow [2025-04-26 16:58:40,215 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 63 places, 50 transitions, 136 flow [2025-04-26 16:58:40,220 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:40,485 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1100#[L28, L114, L99-1, L90]true [2025-04-26 16:58:40,670 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3538#[thread1EXIT, thread2EXIT, L84, thread5EXIT, L75, L24]true [2025-04-26 16:58:40,717 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4544#[thread6EXIT, L27, L75, L99, L84-1]true [2025-04-26 16:58:40,739 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4926#[L114, L75, L99, L27, L84-1]true [2025-04-26 16:58:40,746 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 4308#[thread1EXIT, L84-1, thread2EXIT, L99, L75, L24]true [2025-04-26 16:58:41,273 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14748#[L60, thread1EXIT, thread4EXIT, L69, L23]true [2025-04-26 16:58:41,275 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15426#[L69, L60, thread1EXIT, thread5EXIT, thread4EXIT, L24]true [2025-04-26 16:58:41,312 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16816#[L69, L60, L26, L84, thread6EXIT, thread5EXIT]true [2025-04-26 16:58:41,433 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16700#[L69-1, L60, thread1EXIT, L84, thread5EXIT, L24]true [2025-04-26 16:58:41,443 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 19750#[L69, L60, L26, L84, thread6EXIT, L99]true [2025-04-26 16:58:41,506 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20308#[L69, L26, L60, L84, L99, L114]true [2025-04-26 16:58:41,527 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 19592#[L69-1, L60, thread1EXIT, L84, L24, L105]true [2025-04-26 16:58:41,532 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 19282#[L69-1, L60, thread1EXIT, L84, L99, L24]true [2025-04-26 16:58:41,533 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16486#[L84, L69-1, L60, thread1EXIT, L23]true [2025-04-26 16:58:41,549 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 23684#[thread3EXIT, L105, thread4EXIT, thread2EXIT, L41, L25, L120]true [2025-04-26 16:58:41,613 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24804#[thread3EXIT, thread2EXIT, L41, L25, L99-1, L114, L90]true [2025-04-26 16:58:41,613 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24972#[thread3EXIT, L105, thread2EXIT, L41, L25, L120, L90]true [2025-04-26 16:58:41,708 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 28546#[L41, thread2EXIT, L84, thread5EXIT, L75, L24]true [2025-04-26 16:58:41,858 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 32000#[thread2EXIT, L41, L25, L99, L84-1, L114, L75]true [2025-04-26 16:58:41,860 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 32286#[L105, thread2EXIT, L41, L25, L120, L90, L75]true [2025-04-26 16:58:41,861 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29446#[L41, L84-1, thread2EXIT, L99, L75, L24]true [2025-04-26 16:58:42,076 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 38494#[thread3EXIT, thread6EXIT, L25, L99, L40, L54, L90]true [2025-04-26 16:58:42,086 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 38906#[thread3EXIT, L105, L25, L40, L120, L54, L90]true [2025-04-26 16:58:42,088 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39048#[thread3EXIT, L99, L25, L40, L120, L54, L90]true [2025-04-26 16:58:42,092 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 38622#[thread3EXIT, L41, L25, L99-1, L54, L114, L90]true [2025-04-26 16:58:42,093 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 38912#[thread3EXIT, L105, L41, L25, L120, L54, L90]true [2025-04-26 16:58:42,193 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 42334#[thread4EXIT, thread6EXIT, L25, L69, thread5EXIT, L40, L54]true [2025-04-26 16:58:42,213 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 42950#[L60, L67, thread5EXIT, L41, thread4EXIT, L24]true [2025-04-26 16:58:42,241 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44082#[thread4EXIT, L105, L41, L25, L69, L120, L54]true [2025-04-26 16:58:42,242 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 43046#[L69, L40, L60, L24, thread4EXIT, L105]true [2025-04-26 16:58:42,372 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 48890#[L84, thread6EXIT, L40, L25, thread5EXIT, L69, L54]true [2025-04-26 16:58:42,477 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 50472#[L84, L54-1, L40, L25, thread5EXIT, L69, L120]true [2025-04-26 16:58:42,477 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 50570#[L84, L25, thread5EXIT, L40, L60, L120, L75]true [2025-04-26 16:58:42,485 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 48128#[L40, L69-1, L60, L84, thread5EXIT, L24]true [2025-04-26 16:58:42,486 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 47438#[L40, L60, L82, thread5EXIT, L75, L24]true [2025-04-26 16:58:42,602 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 56914#[L84, thread6EXIT, L25, L99, L69, L40, L54]true [2025-04-26 16:58:42,616 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57200#[L54-1, thread6EXIT, L99, L25, L40, L69, L90]true [2025-04-26 16:58:42,818 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 65260#[L105, L84, L25, L40, L69, L120, L54]true [2025-04-26 16:58:42,847 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 63532#[L84, L54-1, L99, L25, L69, L40, L120]true [2025-04-26 16:58:42,848 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 63378#[L99, L25, L84-1, L40, L60, L120, L75]true [2025-04-26 16:58:42,856 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 53018#[L40, L69-1, L60, L84, L105, L24]true [2025-04-26 16:58:42,887 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 52128#[L40, L69-1, L60, L84, L99, L24]true [2025-04-26 16:58:42,892 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44702#[L84, L69-1, L60, L40, L23]true [2025-04-26 16:58:42,893 WARN L140 AmpleReduction]: Number of pruned transitions: 68758 [2025-04-26 16:58:42,893 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 43 [2025-04-26 16:58:42,893 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3591 [2025-04-26 16:58:42,894 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:93 [2025-04-26 16:58:42,894 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:17348 [2025-04-26 16:58:42,894 WARN L145 AmpleReduction]: Times succ was already a loop node:2024 [2025-04-26 16:58:42,894 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8721 [2025-04-26 16:58:42,894 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:42,953 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 20990 states, 20989 states have (on average 1.9439230072895326) internal successors, (in total 40801), 20989 states have internal predecessors, (40801), 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:58:42,965 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:42,965 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:42,965 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:42,965 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:42,965 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:42,965 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:42,965 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:42,966 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:42,999 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20990 states, 20989 states have (on average 1.9439230072895326) internal successors, (in total 40801), 20989 states have internal predecessors, (40801), 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:58:43,276 INFO L131 ngComponentsAnalysis]: Automaton has 980 accepting balls. 17363 [2025-04-26 16:58:43,278 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:43,278 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:43,282 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:43,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:43,283 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:43,310 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20990 states, 20989 states have (on average 1.9439230072895326) internal successors, (in total 40801), 20989 states have internal predecessors, (40801), 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:58:43,525 INFO L131 ngComponentsAnalysis]: Automaton has 980 accepting balls. 17363 [2025-04-26 16:58:43,525 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:43,525 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:43,526 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:43,526 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:43,531 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L20: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f6_1 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0) (= v_x6_1 0)) InVars {f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[183] L20-->L41-1: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" [2025-04-26 16:58:43,531 INFO L754 eck$LassoCheckResult]: Loop: "[131] L41-1-->L39: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[133] L39-->L40: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[134] L40-->L41: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[135] L41-->L41-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" [2025-04-26 16:58:43,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 4368, now seen corresponding path program 1 times [2025-04-26 16:58:43,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:43,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341453986] [2025-04-26 16:58:43,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:43,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:43,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:43,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:43,589 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:43,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:43,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:43,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:43,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:43,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:43,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:43,616 INFO L85 PathProgramCache]: Analyzing trace with hash 4958244, now seen corresponding path program 1 times [2025-04-26 16:58:43,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:43,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102494222] [2025-04-26 16:58:43,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:43,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:43,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:43,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:43,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:43,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:43,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:43,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:43,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:43,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:43,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:43,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash -256992845, now seen corresponding path program 1 times [2025-04-26 16:58:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:43,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044438411] [2025-04-26 16:58:43,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:43,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:43,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:43,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:43,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:43,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:43,806 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:58:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:43,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044438411] [2025-04-26 16:58:43,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044438411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:43,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:58:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031160757] [2025-04-26 16:58:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:43,916 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:43,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:43,917 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:43,917 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:43,917 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:43,917 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:43,917 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:43,917 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:43,917 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:43,917 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:43,917 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:43,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:43,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:43,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:44,010 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:44,010 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:44,014 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:58:44,016 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:58:44,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:44,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:44,034 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:44,034 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:44,040 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:58:44,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:44,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:44,043 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:58:44,044 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:58:44,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:44,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:44,063 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:58:44,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:44,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:44,066 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:58:44,067 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:58:44,069 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:44,069 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:44,092 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:44,096 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:58:44,097 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:44,097 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:44,097 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:44,097 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:44,097 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:44,097 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:44,097 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:44,097 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:44,097 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:44,097 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:44,097 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:44,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:44,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:44,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:44,140 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:44,142 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:44,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:44,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:44,145 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:58:44,146 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:58:44,148 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:58:44,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:44,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:44,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:44,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:44,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:44,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:44,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:44,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:44,167 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:44,168 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:44,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:44,172 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:58:44,173 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:58:44,173 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:44,176 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:44,176 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:58:44,177 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:44,177 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:44,177 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f1) = 1*f1 Supporting invariants [] [2025-04-26 16:58:44,183 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:58:44,185 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:44,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:44,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:44,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:44,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:44,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:44,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:44,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:44,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:44,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:44,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:44,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:44,230 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:58:44,244 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:58:44,275 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 20990 states, 20989 states have (on average 1.9439230072895326) internal successors, (in total 40801), 20989 states have internal predecessors, (40801), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:58:44,818 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 20990 states, 20989 states have (on average 1.9439230072895326) internal successors, (in total 40801), 20989 states have internal predecessors, (40801), 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 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 48920 states and 92877 transitions. Complement of second has 5 states. [2025-04-26 16:58:44,822 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:58:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:58:44,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-04-26 16:58:44,831 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:44,832 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:44,832 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:58:44,833 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:44,833 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:58:44,833 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:44,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48920 states and 92877 transitions. [2025-04-26 16:58:45,545 INFO L131 ngComponentsAnalysis]: Automaton has 1468 accepting balls. 21802 [2025-04-26 16:58:45,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48920 states to 37542 states and 70270 transitions. [2025-04-26 16:58:45,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28792 [2025-04-26 16:58:45,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30391 [2025-04-26 16:58:45,910 INFO L74 IsDeterministic]: Start isDeterministic. Operand 37542 states and 70270 transitions. [2025-04-26 16:58:45,911 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:45,911 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37542 states and 70270 transitions. [2025-04-26 16:58:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37542 states and 70270 transitions. [2025-04-26 16:58:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37542 to 30456. [2025-04-26 16:58:46,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30456 states, 30456 states have (on average 1.8991660099816128) internal successors, (in total 57841), 30455 states have internal predecessors, (57841), 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:58:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30456 states to 30456 states and 57841 transitions. [2025-04-26 16:58:46,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30456 states and 57841 transitions. [2025-04-26 16:58:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:46,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:46,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:46,746 INFO L87 Difference]: Start difference. First operand 30456 states and 57841 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 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:58:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:46,984 INFO L93 Difference]: Finished difference Result 30621 states and 54107 transitions. [2025-04-26 16:58:46,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30621 states and 54107 transitions. [2025-04-26 16:58:47,204 INFO L131 ngComponentsAnalysis]: Automaton has 1296 accepting balls. 18644 [2025-04-26 16:58:47,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30621 states to 25650 states and 46516 transitions. [2025-04-26 16:58:47,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25650 [2025-04-26 16:58:47,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25650 [2025-04-26 16:58:47,367 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25650 states and 46516 transitions. [2025-04-26 16:58:47,424 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:47,424 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25650 states and 46516 transitions. [2025-04-26 16:58:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states and 46516 transitions. [2025-04-26 16:58:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 18843. [2025-04-26 16:58:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18843 states, 18843 states have (on average 1.8431778379238974) internal successors, (in total 34731), 18842 states have internal predecessors, (34731), 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:58:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18843 states to 18843 states and 34731 transitions. [2025-04-26 16:58:48,048 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18843 states and 34731 transitions. [2025-04-26 16:58:48,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:48,049 INFO L438 stractBuchiCegarLoop]: Abstraction has 18843 states and 34731 transitions. [2025-04-26 16:58:48,049 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:48,049 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18843 states and 34731 transitions. [2025-04-26 16:58:48,109 INFO L131 ngComponentsAnalysis]: Automaton has 840 accepting balls. 14217 [2025-04-26 16:58:48,109 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:48,109 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:48,109 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:58:48,109 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:48,110 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L20: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f6_1 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0) (= v_x6_1 0)) InVars {f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[183] L20-->L41-1: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[130] L41-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[132] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[168] L20-1-->L52: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:48,110 INFO L754 eck$LassoCheckResult]: Loop: "[137] L52-->L54: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[139] L54-->L54-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[140] L54-1-->L60: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[141] L60-->L52: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" [2025-04-26 16:58:48,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 130256278, now seen corresponding path program 1 times [2025-04-26 16:58:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720612480] [2025-04-26 16:58:48,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:48,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,115 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:48,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:48,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash 5142948, now seen corresponding path program 1 times [2025-04-26 16:58:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767146397] [2025-04-26 16:58:48,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:48,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:48,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:48,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:48,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:48,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:48,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:48,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,129 INFO L85 PathProgramCache]: Analyzing trace with hash 968307897, now seen corresponding path program 1 times [2025-04-26 16:58:48,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:48,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469095572] [2025-04-26 16:58:48,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:48,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:48,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:48,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:48,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,153 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:58:48,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:48,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469095572] [2025-04-26 16:58:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469095572] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:48,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:48,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:48,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962819306] [2025-04-26 16:58:48,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:48,185 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,185 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,185 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,185 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,185 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:48,185 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,185 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,185 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,185 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:48,185 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,185 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,227 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,228 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,231 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:58:48,231 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:58:48,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:48,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,244 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:48,244 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f3=1} Honda state: {f3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:48,250 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:58:48,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,277 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:58:48,277 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:58:48,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:48,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:58:48,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,298 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:58:48,299 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:58:48,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:48,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:48,324 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:48,329 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:58:48,329 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:48,330 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:48,330 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:48,330 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:48,330 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:48,330 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,330 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:48,330 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:48,330 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:48,330 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:48,330 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:48,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:48,377 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:48,377 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:48,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,380 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:58:48,382 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:58:48,383 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:58:48,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:48,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:48,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:48,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:48,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:48,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:48,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:48,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:48,399 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:48,399 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:48,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:48,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:48,402 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:58:48,403 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:58:48,404 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:48,407 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:48,407 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:58:48,407 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:48,407 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:48,408 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-04-26 16:58:48,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:48,414 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:48,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:48,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:48,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:48,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:48,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:48,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:48,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:48,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:48,482 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:58:48,482 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:48,483 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18843 states and 34731 transitions. cyclomatic complexity: 16728 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:58:48,782 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18843 states and 34731 transitions. cyclomatic complexity: 16728. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 53975 states and 100055 transitions. Complement of second has 5 states. [2025-04-26 16:58:48,782 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:58:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:58:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-04-26 16:58:48,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 81 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:58:48,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 81 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:58:48,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,783 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 81 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:58:48,783 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:48,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53975 states and 100055 transitions. [2025-04-26 16:58:49,426 INFO L131 ngComponentsAnalysis]: Automaton has 1772 accepting balls. 23258 [2025-04-26 16:58:49,838 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53975 states to 46238 states and 85111 transitions. [2025-04-26 16:58:49,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33103 [2025-04-26 16:58:49,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34630 [2025-04-26 16:58:49,881 INFO L74 IsDeterministic]: Start isDeterministic. Operand 46238 states and 85111 transitions. [2025-04-26 16:58:49,881 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:49,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46238 states and 85111 transitions. [2025-04-26 16:58:49,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46238 states and 85111 transitions. [2025-04-26 16:58:50,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46238 to 39064. [2025-04-26 16:58:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39064 states, 39064 states have (on average 1.8562359205406513) internal successors, (in total 72512), 39063 states have internal predecessors, (72512), 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:58:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39064 states to 39064 states and 72512 transitions. [2025-04-26 16:58:50,646 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39064 states and 72512 transitions. [2025-04-26 16:58:50,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:50,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:50,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:50,646 INFO L87 Difference]: Start difference. First operand 39064 states and 72512 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 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:58:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:50,868 INFO L93 Difference]: Finished difference Result 47413 states and 83221 transitions. [2025-04-26 16:58:50,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47413 states and 83221 transitions. [2025-04-26 16:58:51,305 INFO L131 ngComponentsAnalysis]: Automaton has 2030 accepting balls. 23740 [2025-04-26 16:58:51,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47413 states to 38264 states and 67114 transitions. [2025-04-26 16:58:51,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35775 [2025-04-26 16:58:51,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36541 [2025-04-26 16:58:51,541 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38264 states and 67114 transitions. [2025-04-26 16:58:51,589 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:51,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38264 states and 67114 transitions. [2025-04-26 16:58:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38264 states and 67114 transitions. [2025-04-26 16:58:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38264 to 22986. [2025-04-26 16:58:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22986 states, 22986 states have (on average 1.772992256155921) internal successors, (in total 40754), 22985 states have internal predecessors, (40754), 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:58:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22986 states to 22986 states and 40754 transitions. [2025-04-26 16:58:52,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22986 states and 40754 transitions. [2025-04-26 16:58:52,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:52,097 INFO L438 stractBuchiCegarLoop]: Abstraction has 22986 states and 40754 transitions. [2025-04-26 16:58:52,097 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:52,097 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22986 states and 40754 transitions. [2025-04-26 16:58:52,170 INFO L131 ngComponentsAnalysis]: Automaton has 1074 accepting balls. 13968 [2025-04-26 16:58:52,170 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:52,171 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:52,171 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:52,171 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:52,172 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L20: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f6_1 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0) (= v_x6_1 0)) InVars {f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[183] L20-->L41-1: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[130] L41-1-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[132] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[168] L20-1-->L52: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[136] L52-->thread2FINAL: Formula: (<= v_z_3 v_x2_1) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[138] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[171] L21-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" [2025-04-26 16:58:52,172 INFO L754 eck$LassoCheckResult]: Loop: "[143] L67-->L69: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[145] L69-->L69-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[146] L69-1-->L75: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[147] L75-->L67: Formula: (= v_f4_1 1) InVars {} OutVars{f4=v_f4_1} AuxVars[] AssignedVars[f4]" [2025-04-26 16:58:52,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash 2109444755, now seen corresponding path program 1 times [2025-04-26 16:58:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:52,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088095886] [2025-04-26 16:58:52,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:52,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:52,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:52,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:52,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:52,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:52,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:52,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash 5327652, now seen corresponding path program 1 times [2025-04-26 16:58:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:52,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737215939] [2025-04-26 16:58:52,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:52,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:52,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:52,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:52,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:52,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:52,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:52,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:52,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash 972899510, now seen corresponding path program 1 times [2025-04-26 16:58:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:52,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657487620] [2025-04-26 16:58:52,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:52,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:52,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:52,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:52,213 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:58:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:52,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657487620] [2025-04-26 16:58:52,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657487620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:52,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:52,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987280722] [2025-04-26 16:58:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:52,238 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:52,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:52,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:52,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:52,238 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:52,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:52,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:52,238 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:52,238 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:52,238 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:52,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,280 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:52,280 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:52,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,283 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:58:52,284 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:58:52,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:52,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:52,296 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:58:52,296 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f4=1} Honda state: {f4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:58:52,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:58:52,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,304 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:58:52,305 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:58:52,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:52,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:52,327 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:58:52,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,330 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:58:52,332 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:58:52,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:52,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:52,358 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:52,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:52,362 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:52,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:52,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:52,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:52,362 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:52,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:52,362 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:52,362 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:52,362 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:52,362 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:52,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:52,402 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:52,402 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:52,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,404 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:58:52,406 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:58:52,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:52,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:52,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:52,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:52,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:52,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:52,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:52,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:52,419 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:58:52,425 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:58:52,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,427 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:52,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:58:52,429 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:58:52,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:52,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:52,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:52,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:52,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:52,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:52,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:52,442 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:52,444 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:52,444 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:52,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:52,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,446 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:52,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:58:52,448 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:52,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:52,452 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:52,452 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:52,452 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f3) = 1*f3 Supporting invariants [] [2025-04-26 16:58:52,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:52,458 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:52,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:52,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:52,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:52,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:52,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:52,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:52,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:52,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:52,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:52,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:52,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:52,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:52,518 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:58:52,519 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:52,519 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22986 states and 40754 transitions. cyclomatic complexity: 18969 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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:58:52,906 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22986 states and 40754 transitions. cyclomatic complexity: 18969. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 51549 states and 88239 transitions. Complement of second has 5 states. [2025-04-26 16:58:52,906 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:58:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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:58:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-04-26 16:58:52,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 81 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:58:52,910 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:52,910 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 81 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:58:52,910 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:52,911 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 81 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:58:52,912 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:52,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51549 states and 88239 transitions. [2025-04-26 16:58:53,271 INFO L131 ngComponentsAnalysis]: Automaton has 1959 accepting balls. 20570 [2025-04-26 16:58:53,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51549 states to 45548 states and 78338 transitions. [2025-04-26 16:58:53,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33165 [2025-04-26 16:58:53,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34008 [2025-04-26 16:58:53,706 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45548 states and 78338 transitions. [2025-04-26 16:58:53,706 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:53,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45548 states and 78338 transitions. [2025-04-26 16:58:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45548 states and 78338 transitions. [2025-04-26 16:58:54,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45548 to 40760. [2025-04-26 16:58:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40760 states, 40760 states have (on average 1.7338812561334642) internal successors, (in total 70673), 40759 states have internal predecessors, (70673), 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:58:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40760 states to 40760 states and 70673 transitions. [2025-04-26 16:58:54,320 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40760 states and 70673 transitions. [2025-04-26 16:58:54,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:54,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:54,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:54,321 INFO L87 Difference]: Start difference. First operand 40760 states and 70673 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 2 states have internal predecessors, (12), 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:58:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:54,576 INFO L93 Difference]: Finished difference Result 55699 states and 95912 transitions. [2025-04-26 16:58:54,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55699 states and 95912 transitions. [2025-04-26 16:58:55,115 INFO L131 ngComponentsAnalysis]: Automaton has 3178 accepting balls. 26982 [2025-04-26 16:58:55,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55699 states to 45657 states and 79069 transitions. [2025-04-26 16:58:55,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42466 [2025-04-26 16:58:55,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42961 [2025-04-26 16:58:55,350 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45657 states and 79069 transitions. [2025-04-26 16:58:55,374 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45657 states and 79069 transitions. [2025-04-26 16:58:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45657 states and 79069 transitions. [2025-04-26 16:58:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45657 to 31248. [2025-04-26 16:58:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31248 states, 31248 states have (on average 1.7598886328725039) internal successors, (in total 54993), 31247 states have internal predecessors, (54993), 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:58:55,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31248 states to 31248 states and 54993 transitions. [2025-04-26 16:58:55,930 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31248 states and 54993 transitions. [2025-04-26 16:58:55,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:55,930 INFO L438 stractBuchiCegarLoop]: Abstraction has 31248 states and 54993 transitions. [2025-04-26 16:58:55,931 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:55,931 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31248 states and 54993 transitions. [2025-04-26 16:58:56,035 INFO L131 ngComponentsAnalysis]: Automaton has 2034 accepting balls. 18262 [2025-04-26 16:58:56,035 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:56,035 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:56,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:56,036 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:58:56,036 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L20: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f6_1 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0) (= v_x6_1 0)) InVars {f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[183] L20-->L41-1: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[131] L41-1-->L39: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[133] L39-->L40: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[134] L40-->L41: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[168] L20-1-->L52: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[137] L52-->L54: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[171] L21-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[143] L67-->L69: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[174] L22-->L82: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" [2025-04-26 16:58:56,036 INFO L754 eck$LassoCheckResult]: Loop: "[149] L82-->L84: Formula: (< v_x4_5 v_z_8) InVars {x4=v_x4_5, z=v_z_8} OutVars{x4=v_x4_5, z=v_z_8} AuxVars[] AssignedVars[]" "[151] L84-->L84-1: Formula: (and (< 0 v_f4_6) (= v_f4_5 0)) InVars {f4=v_f4_6} OutVars{f4=v_f4_5} AuxVars[] AssignedVars[f4]" "[152] L84-1-->L90: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[153] L90-->L82: Formula: (= v_f5_2 1) InVars {} OutVars{f5=v_f5_2} AuxVars[] AssignedVars[f5]" [2025-04-26 16:58:56,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1638296213, now seen corresponding path program 1 times [2025-04-26 16:58:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381831740] [2025-04-26 16:58:56,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 5512356, now seen corresponding path program 1 times [2025-04-26 16:58:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030030482] [2025-04-26 16:58:56,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:56,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:56,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,052 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:56,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:56,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -52749000, now seen corresponding path program 1 times [2025-04-26 16:58:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941242738] [2025-04-26 16:58:56,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:56,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:56,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,096 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:58:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:56,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941242738] [2025-04-26 16:58:56,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941242738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:56,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056308214] [2025-04-26 16:58:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:56,118 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,119 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,119 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,119 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,119 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,119 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,119 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,119 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,119 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:56,119 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,119 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,153 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,153 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,155 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:56,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:58:56,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,158 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,180 INFO L229 MonitoredProcess]: Starting monitored process 20 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:58:56,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:58:56,186 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,253 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:58:56,257 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,257 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,257 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,257 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,257 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,257 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,257 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,257 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,257 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:56,257 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,258 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,266 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,291 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,291 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,294 INFO L229 MonitoredProcess]: Starting monitored process 21 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:58:56,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:58:56,296 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:58:56,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,308 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,311 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:56,311 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:56,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,313 INFO L229 MonitoredProcess]: Starting monitored process 22 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:58:56,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:58:56,316 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,318 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:56,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:58:56,319 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,319 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,319 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:58:56,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,326 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:56,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:56,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,401 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:58:56,402 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:56,402 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31248 states and 54993 transitions. cyclomatic complexity: 26012 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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:58:56,951 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31248 states and 54993 transitions. cyclomatic complexity: 26012. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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 65643 states and 115531 transitions. Complement of second has 6 states. [2025-04-26 16:58:56,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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:58:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-04-26 16:58:56,953 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:56,953 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,953 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:58:56,953 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,953 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:58:56,953 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65643 states and 115531 transitions. [2025-04-26 16:58:57,600 INFO L131 ngComponentsAnalysis]: Automaton has 3354 accepting balls. 16125 [2025-04-26 16:58:57,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65643 states to 45757 states and 79152 transitions. [2025-04-26 16:58:57,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23809 [2025-04-26 16:58:57,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25247 [2025-04-26 16:58:57,849 INFO L74 IsDeterministic]: Start isDeterministic. Operand 45757 states and 79152 transitions. [2025-04-26 16:58:57,849 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:57,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45757 states and 79152 transitions. [2025-04-26 16:58:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45757 states and 79152 transitions. [2025-04-26 16:58:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45757 to 44459. [2025-04-26 16:58:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44459 states, 44459 states have (on average 1.7388830158123214) internal successors, (in total 77309), 44458 states have internal predecessors, (77309), 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:58:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44459 states to 44459 states and 77309 transitions. [2025-04-26 16:58:58,472 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44459 states and 77309 transitions. [2025-04-26 16:58:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:58,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:58,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:58,473 INFO L87 Difference]: Start difference. First operand 44459 states and 77309 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 2 states have internal predecessors, (14), 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:58:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:58,932 INFO L93 Difference]: Finished difference Result 72425 states and 126000 transitions. [2025-04-26 16:58:58,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72425 states and 126000 transitions. [2025-04-26 16:58:59,463 INFO L131 ngComponentsAnalysis]: Automaton has 6469 accepting balls. 30167 [2025-04-26 16:58:59,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72425 states to 69592 states and 120620 transitions. [2025-04-26 16:58:59,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41905 [2025-04-26 16:58:59,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43482 [2025-04-26 16:58:59,850 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69592 states and 120620 transitions. [2025-04-26 16:58:59,851 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:59,851 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69592 states and 120620 transitions. [2025-04-26 16:58:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69592 states and 120620 transitions. [2025-04-26 16:59:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69592 to 59128. [2025-04-26 16:59:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59128 states, 59128 states have (on average 1.7555980246245433) internal successors, (in total 103805), 59127 states have internal predecessors, (103805), 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:59:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59128 states to 59128 states and 103805 transitions. [2025-04-26 16:59:01,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59128 states and 103805 transitions. [2025-04-26 16:59:01,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:59:01,074 INFO L438 stractBuchiCegarLoop]: Abstraction has 59128 states and 103805 transitions. [2025-04-26 16:59:01,074 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:59:01,074 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59128 states and 103805 transitions. [2025-04-26 16:59:01,263 INFO L131 ngComponentsAnalysis]: Automaton has 4841 accepting balls. 23121 [2025-04-26 16:59:01,263 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:01,263 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:01,265 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:01,265 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:59:01,265 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L20: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f6_1 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0) (= v_x6_1 0)) InVars {f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[183] L20-->L41-1: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[131] L41-1-->L39: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[133] L39-->L40: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[134] L40-->L41: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[168] L20-1-->L52: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[137] L52-->L54: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[171] L21-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[143] L67-->L69: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[174] L22-->L82: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[149] L82-->L84: Formula: (< v_x4_5 v_z_8) InVars {x4=v_x4_5, z=v_z_8} OutVars{x4=v_x4_5, z=v_z_8} AuxVars[] AssignedVars[]" "[177] L23-->L97: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" [2025-04-26 16:59:01,265 INFO L754 eck$LassoCheckResult]: Loop: "[155] L97-->L99: Formula: (< v_x5_2 v_z_9) InVars {x5=v_x5_2, z=v_z_9} OutVars{x5=v_x5_2, z=v_z_9} AuxVars[] AssignedVars[]" "[157] L99-->L99-1: Formula: (and (= v_f5_5 0) (< 0 v_f5_6)) InVars {f5=v_f5_6} OutVars{f5=v_f5_5} AuxVars[] AssignedVars[f5]" "[158] L99-1-->L105: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" "[159] L105-->L97: Formula: (= v_f6_2 1) InVars {} OutVars{f6=v_f6_2} AuxVars[] AssignedVars[f6]" [2025-04-26 16:59:01,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1850332143, now seen corresponding path program 1 times [2025-04-26 16:59:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:01,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736342410] [2025-04-26 16:59:01,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:01,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:59:01,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:59:01,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:01,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:01,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:01,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:59:01,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:59:01,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:01,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:01,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:01,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash 5697060, now seen corresponding path program 1 times [2025-04-26 16:59:01,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:01,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433819757] [2025-04-26 16:59:01,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:01,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:59:01,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:59:01,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:01,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:01,286 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:01,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:59:01,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:59:01,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:01,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:01,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:01,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash 871928372, now seen corresponding path program 1 times [2025-04-26 16:59:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:01,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754174715] [2025-04-26 16:59:01,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:01,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:59:01,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:59:01,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:01,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:01,323 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:59:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:59:01,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754174715] [2025-04-26 16:59:01,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754174715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:59:01,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:59:01,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:59:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003849668] [2025-04-26 16:59:01,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:59:01,343 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:01,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:01,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:01,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:01,343 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:01,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:01,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:01,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:01,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:01,343 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:01,343 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:01,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:01,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:01,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:01,376 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:01,377 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:01,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:01,380 INFO L229 MonitoredProcess]: Starting monitored process 23 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:59:01,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:59:01,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:01,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:01,393 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:59:01,394 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f6=1} Honda state: {f6=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:59:01,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:59:01,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:01,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:01,401 INFO L229 MonitoredProcess]: Starting monitored process 24 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:59:01,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:59:01,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:01,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:01,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:59:01,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:01,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:01,421 INFO L229 MonitoredProcess]: Starting monitored process 25 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:59:01,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:59:01,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:01,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:01,483 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:01,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:59:01,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:01,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:01,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:01,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:01,488 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:01,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:01,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:01,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:01,488 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:01,488 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:01,488 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:01,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:01,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:01,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:01,521 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:01,521 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:01,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:01,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:01,526 INFO L229 MonitoredProcess]: Starting monitored process 26 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:59:01,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:59:01,529 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:59:01,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:01,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:01,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:01,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:01,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:01,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:01,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:01,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:01,546 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:01,546 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:01,548 INFO L229 MonitoredProcess]: Starting monitored process 27 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:59:01,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:59:01,551 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:01,554 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:59:01,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:01,555 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:01,555 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:01,555 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:59:01,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:59:01,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:01,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:01,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:59:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:59:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:01,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:01,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:01,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:59:01,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:59:01,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:01,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:01,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:01,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:01,639 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:59:01,639 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:01,639 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59128 states and 103805 transitions. cyclomatic complexity: 53179 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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:59:02,498 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59128 states and 103805 transitions. cyclomatic complexity: 53179. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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 146816 states and 260186 transitions. Complement of second has 6 states. [2025-04-26 16:59:02,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (in total 16), 4 states have internal predecessors, (16), 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:59:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 16:59:02,500 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:59:02,500 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:02,500 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 16 letters. Loop has 4 letters. [2025-04-26 16:59:02,500 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:02,500 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 12 letters. Loop has 8 letters. [2025-04-26 16:59:02,500 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:02,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146816 states and 260186 transitions. [2025-04-26 16:59:03,488 INFO L131 ngComponentsAnalysis]: Automaton has 4599 accepting balls. 20236 [2025-04-26 16:59:03,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146816 states to 71311 states and 124749 transitions. [2025-04-26 16:59:03,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27058 [2025-04-26 16:59:03,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28185 [2025-04-26 16:59:03,843 INFO L74 IsDeterministic]: Start isDeterministic. Operand 71311 states and 124749 transitions. [2025-04-26 16:59:03,843 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:03,843 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71311 states and 124749 transitions. [2025-04-26 16:59:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71311 states and 124749 transitions. [2025-04-26 16:59:04,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71311 to 69263. [2025-04-26 16:59:04,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69263 states, 69263 states have (on average 1.751526789194808) internal successors, (in total 121316), 69262 states have internal predecessors, (121316), 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:59:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69263 states to 69263 states and 121316 transitions. [2025-04-26 16:59:04,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69263 states and 121316 transitions. [2025-04-26 16:59:04,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:59:04,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:59:04,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:59:04,943 INFO L87 Difference]: Start difference. First operand 69263 states and 121316 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 2 states have internal predecessors, (16), 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:59:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:59:05,672 INFO L93 Difference]: Finished difference Result 108404 states and 186650 transitions. [2025-04-26 16:59:05,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108404 states and 186650 transitions. [2025-04-26 16:59:06,446 INFO L131 ngComponentsAnalysis]: Automaton has 6978 accepting balls. 31392 [2025-04-26 16:59:06,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108404 states to 106045 states and 182923 transitions. [2025-04-26 16:59:06,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41244 [2025-04-26 16:59:07,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43361 [2025-04-26 16:59:07,113 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106045 states and 182923 transitions. [2025-04-26 16:59:07,113 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:07,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106045 states and 182923 transitions. [2025-04-26 16:59:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106045 states and 182923 transitions. [2025-04-26 16:59:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106045 to 81769. [2025-04-26 16:59:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81769 states, 81769 states have (on average 1.7221440888356223) internal successors, (in total 140818), 81768 states have internal predecessors, (140818), 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:59:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81769 states to 81769 states and 140818 transitions. [2025-04-26 16:59:08,512 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81769 states and 140818 transitions. [2025-04-26 16:59:08,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:59:08,514 INFO L438 stractBuchiCegarLoop]: Abstraction has 81769 states and 140818 transitions. [2025-04-26 16:59:08,514 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:59:08,514 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81769 states and 140818 transitions. [2025-04-26 16:59:09,090 INFO L131 ngComponentsAnalysis]: Automaton has 4659 accepting balls. 21342 [2025-04-26 16:59:09,090 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:09,090 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:09,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:09,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:09,094 INFO L752 eck$LassoCheckResult]: Stem: "[104] $Ultimate##0-->L20: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_f6_1 0) (= v_x5_1 0) (= v_f1_3 0) (= v_f5_1 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x4_1 0) (= v_f4_2 0) (= v_x2_5 0) (= v_x6_1 0)) InVars {f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} OutVars{f6=v_f6_1, f4=v_f4_2, x6=v_x6_1, f5=v_f5_1, f2=v_f2_4, x4=v_x4_1, f3=v_f3_4, x5=v_x5_1, x2=v_x2_5, f1=v_f1_3, x3=v_x3_5, x1=v_x1_5} AuxVars[] AssignedVars[]" "[183] L20-->L41-1: Formula: (= v_thread1Thread1of1ForFork5_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork5_thidvar0=v_thread1Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork5_thidvar0]" "[131] L41-1-->L39: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[133] L39-->L40: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[134] L40-->L41: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[168] L20-1-->L52: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[137] L52-->L54: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[171] L21-->L67: Formula: (and (= 3 v_thread3Thread1of1ForFork1_thidvar2_2) (= 3 v_thread3Thread1of1ForFork1_thidvar0_2) (= 3 v_thread3Thread1of1ForFork1_thidvar1_2)) InVars {} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2]" "[143] L67-->L69: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[174] L22-->L82: Formula: (and (= 4 v_thread4Thread1of1ForFork2_thidvar2_2) (= 4 v_thread4Thread1of1ForFork2_thidvar3_2) (= 4 v_thread4Thread1of1ForFork2_thidvar1_2) (= 4 v_thread4Thread1of1ForFork2_thidvar0_2)) InVars {} OutVars{thread4Thread1of1ForFork2_thidvar3=v_thread4Thread1of1ForFork2_thidvar3_2, thread4Thread1of1ForFork2_thidvar0=v_thread4Thread1of1ForFork2_thidvar0_2, thread4Thread1of1ForFork2_thidvar2=v_thread4Thread1of1ForFork2_thidvar2_2, thread4Thread1of1ForFork2_thidvar1=v_thread4Thread1of1ForFork2_thidvar1_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_thidvar3, thread4Thread1of1ForFork2_thidvar0, thread4Thread1of1ForFork2_thidvar2, thread4Thread1of1ForFork2_thidvar1]" "[149] L82-->L84: Formula: (< v_x4_5 v_z_8) InVars {x4=v_x4_5, z=v_z_8} OutVars{x4=v_x4_5, z=v_z_8} AuxVars[] AssignedVars[]" "[177] L23-->L97: Formula: (and (= v_thread5Thread1of1ForFork3_thidvar1_2 5) (= v_thread5Thread1of1ForFork3_thidvar3_2 5) (= v_thread5Thread1of1ForFork3_thidvar4_2 5) (= v_thread5Thread1of1ForFork3_thidvar2_2 5) (= v_thread5Thread1of1ForFork3_thidvar0_2 5)) InVars {} OutVars{thread5Thread1of1ForFork3_thidvar2=v_thread5Thread1of1ForFork3_thidvar2_2, thread5Thread1of1ForFork3_thidvar1=v_thread5Thread1of1ForFork3_thidvar1_2, thread5Thread1of1ForFork3_thidvar4=v_thread5Thread1of1ForFork3_thidvar4_2, thread5Thread1of1ForFork3_thidvar3=v_thread5Thread1of1ForFork3_thidvar3_2, thread5Thread1of1ForFork3_thidvar0=v_thread5Thread1of1ForFork3_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork3_thidvar2, thread5Thread1of1ForFork3_thidvar1, thread5Thread1of1ForFork3_thidvar4, thread5Thread1of1ForFork3_thidvar3, thread5Thread1of1ForFork3_thidvar0]" "[155] L97-->L99: Formula: (< v_x5_2 v_z_9) InVars {x5=v_x5_2, z=v_z_9} OutVars{x5=v_x5_2, z=v_z_9} AuxVars[] AssignedVars[]" "[180] L24-->L112: Formula: (and (= v_thread6Thread1of1ForFork4_thidvar1_2 6) (= v_thread6Thread1of1ForFork4_thidvar2_2 6) (= v_thread6Thread1of1ForFork4_thidvar3_2 6) (= v_thread6Thread1of1ForFork4_thidvar0_2 6) (= v_thread6Thread1of1ForFork4_thidvar5_2 6) (= v_thread6Thread1of1ForFork4_thidvar4_2 6)) InVars {} OutVars{thread6Thread1of1ForFork4_thidvar0=v_thread6Thread1of1ForFork4_thidvar0_2, thread6Thread1of1ForFork4_thidvar1=v_thread6Thread1of1ForFork4_thidvar1_2, thread6Thread1of1ForFork4_thidvar2=v_thread6Thread1of1ForFork4_thidvar2_2, thread6Thread1of1ForFork4_thidvar3=v_thread6Thread1of1ForFork4_thidvar3_2, thread6Thread1of1ForFork4_thidvar4=v_thread6Thread1of1ForFork4_thidvar4_2, thread6Thread1of1ForFork4_thidvar5=v_thread6Thread1of1ForFork4_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork4_thidvar0, thread6Thread1of1ForFork4_thidvar1, thread6Thread1of1ForFork4_thidvar2, thread6Thread1of1ForFork4_thidvar3, thread6Thread1of1ForFork4_thidvar4, thread6Thread1of1ForFork4_thidvar5]" "[161] L112-->L114: Formula: (< v_x6_2 v_z_11) InVars {x6=v_x6_2, z=v_z_11} OutVars{x6=v_x6_2, z=v_z_11} AuxVars[] AssignedVars[]" [2025-04-26 16:59:09,094 INFO L754 eck$LassoCheckResult]: Loop: "[163] L114-->L114-1: Formula: (and (< 0 v_f6_6) (= v_f6_5 0)) InVars {f6=v_f6_6} OutVars{f6=v_f6_5} AuxVars[] AssignedVars[f6]" "[164] L114-1-->L120: Formula: (= (+ v_x6_4 1) v_x6_3) InVars {x6=v_x6_4} OutVars{x6=v_x6_3} AuxVars[] AssignedVars[x6]" "[165] L120-->L112: Formula: (= v_f1_4 1) InVars {} OutVars{f1=v_f1_4} AuxVars[] AssignedVars[f1]" "[161] L112-->L114: Formula: (< v_x6_2 v_z_11) InVars {x6=v_x6_2, z=v_z_11} OutVars{x6=v_x6_2, z=v_z_11} AuxVars[] AssignedVars[]" "[135] L41-->L41-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" "[131] L41-1-->L39: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[133] L39-->L40: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[134] L40-->L41: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[139] L54-->L54-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[140] L54-1-->L60: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[141] L60-->L52: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" "[137] L52-->L54: Formula: (< v_x2_2 v_z_4) InVars {x2=v_x2_2, z=v_z_4} OutVars{x2=v_x2_2, z=v_z_4} AuxVars[] AssignedVars[]" "[145] L69-->L69-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[146] L69-1-->L75: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[147] L75-->L67: Formula: (= v_f4_1 1) InVars {} OutVars{f4=v_f4_1} AuxVars[] AssignedVars[f4]" "[143] L67-->L69: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" [2025-04-26 16:59:09,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1634440553, now seen corresponding path program 1 times [2025-04-26 16:59:09,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:09,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901335821] [2025-04-26 16:59:09,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:09,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:09,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:59:09,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:59:09,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:09,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:59:09,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:59:09,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:09,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 683250997, now seen corresponding path program 1 times [2025-04-26 16:59:09,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:09,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022519454] [2025-04-26 16:59:09,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:09,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:59:09,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:59:09,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:09,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:59:09,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:59:09,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:09,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1195240501, now seen corresponding path program 1 times [2025-04-26 16:59:09,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:09,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731093095] [2025-04-26 16:59:09,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:09,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:59:09,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:59:09,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-26 16:59:09,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:59:09,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731093095] [2025-04-26 16:59:09,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731093095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:59:09,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:59:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:59:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227834157] [2025-04-26 16:59:09,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:59:09,316 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:09,316 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:09,317 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:09,317 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:09,317 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:09,317 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,317 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:09,317 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:09,317 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:09,317 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:09,317 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:09,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,420 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:09,421 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:09,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,423 INFO L229 MonitoredProcess]: Starting monitored process 28 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:59:09,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:59:09,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:09,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:09,435 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:59:09,435 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f3=0} Honda state: {f3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:59:09,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:09,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,442 INFO L229 MonitoredProcess]: Starting monitored process 29 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:59:09,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:59:09,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:09,443 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:09,454 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:59:09,454 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f4=1} Honda state: {f4=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:59:09,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:59:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,461 INFO L229 MonitoredProcess]: Starting monitored process 30 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:59:09,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:59:09,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:09,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:09,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:59:09,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,485 INFO L229 MonitoredProcess]: Starting monitored process 31 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:59:09,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:59:09,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:09,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:09,751 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:09,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:09,759 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:09,759 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:09,759 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:09,759 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:09,759 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:09,759 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,759 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:09,759 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:09,759 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:59:09,759 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:09,759 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:09,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,780 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,853 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:09,854 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:09,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,856 INFO L229 MonitoredProcess]: Starting monitored process 32 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:59:09,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:59:09,857 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:59:09,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:09,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:09,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:09,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:09,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:09,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:09,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:09,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:59:09,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:59:09,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,874 INFO L229 MonitoredProcess]: Starting monitored process 33 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:59:09,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:59:09,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:09,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:09,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:09,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:09,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:09,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:09,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:09,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:09,887 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:59:09,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:59:09,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,893 INFO L229 MonitoredProcess]: Starting monitored process 34 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:59:09,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:59:09,894 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:59:09,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:09,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:09,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:09,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:09,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:09,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:09,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:09,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:09,910 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:09,910 INFO L437 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:09,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,912 INFO L229 MonitoredProcess]: Starting monitored process 35 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:59:09,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:59:09,913 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:09,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:59:09,916 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:09,916 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:09,916 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:59:09,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:09,921 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:09,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:59:09,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:59:09,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:09,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:09,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:09,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:59:09,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:59:09,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:09,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:09,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:09,997 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:59:09,997 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:59:09,997 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 81769 states and 140818 transitions. cyclomatic complexity: 67902 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 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:59:11,144 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 81769 states and 140818 transitions. cyclomatic complexity: 67902. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 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 215277 states and 372309 transitions. Complement of second has 6 states. [2025-04-26 16:59:11,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (in total 31), 4 states have internal predecessors, (31), 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:59:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 16:59:11,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 15 letters. Loop has 16 letters. [2025-04-26 16:59:11,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:11,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 31 letters. Loop has 16 letters. [2025-04-26 16:59:11,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:11,146 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 15 letters. Loop has 32 letters. [2025-04-26 16:59:11,146 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:11,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 215277 states and 372309 transitions. [2025-04-26 16:59:12,917 INFO L131 ngComponentsAnalysis]: Automaton has 4895 accepting balls. 21416 [2025-04-26 16:59:14,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 215277 states to 188618 states and 324441 transitions. [2025-04-26 16:59:14,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32616 [2025-04-26 16:59:14,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36920 [2025-04-26 16:59:14,085 INFO L74 IsDeterministic]: Start isDeterministic. Operand 188618 states and 324441 transitions. [2025-04-26 16:59:14,085 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:14,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 188618 states and 324441 transitions. [2025-04-26 16:59:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188618 states and 324441 transitions. [2025-04-26 16:59:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188618 to 163804. [2025-04-26 16:59:16,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163804 states, 163804 states have (on average 1.732827037190789) internal successors, (in total 283844), 163803 states have internal predecessors, (283844), 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:59:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163804 states to 163804 states and 283844 transitions. [2025-04-26 16:59:16,992 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163804 states and 283844 transitions. [2025-04-26 16:59:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:59:16,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:59:16,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:59:16,993 INFO L87 Difference]: Start difference. First operand 163804 states and 283844 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (in total 31), 2 states have internal predecessors, (31), 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:59:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:59:17,277 INFO L93 Difference]: Finished difference Result 906 states and 1085 transitions. [2025-04-26 16:59:17,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 906 states and 1085 transitions. [2025-04-26 16:59:17,279 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:59:17,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 906 states to 0 states and 0 transitions. [2025-04-26 16:59:17,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:59:17,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:59:17,279 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:59:17,279 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:59:17,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:17,279 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:17,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:59:17,281 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:59:17,281 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:59:17,281 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:59:17,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:59:17,281 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:59:17,293 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:59:17,294 INFO L201 PluginConnector]: Adding new model interleaved6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:59:17 BoogieIcfgContainer [2025-04-26 16:59:17,294 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:59:17,295 INFO L158 Benchmark]: Toolchain (without parser) took 37562.03ms. Allocated memory was 159.4MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 86.0MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2025-04-26 16:59:17,295 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.81ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:59:17,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.05ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:59:17,297 INFO L158 Benchmark]: Boogie Preprocessor took 23.76ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:59:17,297 INFO L158 Benchmark]: RCFGBuilder took 218.80ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 71.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:59:17,297 INFO L158 Benchmark]: BuchiAutomizer took 37284.46ms. Allocated memory was 159.4MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 71.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-26 16:59:17,298 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.81ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.05ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.76ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 218.80ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 71.9MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 37284.46ms. Allocated memory was 159.4MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 71.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.1s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.6s. Büchi inclusion checks took 14.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 10. Automata minimization 11.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 118442 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 11.7s Buchi closure took 0.5s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 785 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 574 IncrementalHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 435 mSDtfsCounter, 574 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT6 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital27 mio100 ax100 hnf100 lsp59 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 34ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 2.8s InitialAbstraction: Time to compute Ample Reduction [ms]: 2775, Number of transitions in reduction automaton: 40801, Number of states in reduction automaton: 20990, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (6 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function f1 and consists of 3 locations. One deterministic module has affine ranking function f2 and consists of 3 locations. One deterministic module has affine ranking function f3 and consists of 3 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these 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:59:17,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...