/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/3_thr/interleaved3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:33,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:33,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:33,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:33,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:33,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:33,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:33,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:33,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:33,345 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:33,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:33,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:33,345 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:33,345 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:33,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:33,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:33,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:33,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:33,347 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:33,347 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:33,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:33,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:33,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:33,572 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:33,573 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:33,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/interleaved3.c.bpl [2025-04-26 18:42:33,574 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/interleaved3.c.bpl' [2025-04-26 18:42:33,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:33,590 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:33,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:33,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:33,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:33,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,624 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:33,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:33,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:33,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:33,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:33,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,632 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:33,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:33,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:33,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:33,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:33,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,678 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 18:42:33,681 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 18:42:33,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:33,699 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:33,699 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:33,699 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:33,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:33,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:33,700 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:33,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:33,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:33,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:33,700 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 18:42:33,737 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:33,738 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:33,813 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:33,813 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:33,824 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:33,824 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:33,825 INFO L201 PluginConnector]: Adding new model interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:33 BoogieIcfgContainer [2025-04-26 18:42:33,825 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:33,826 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:33,826 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:33,831 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:33,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:33,832 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/2) ... [2025-04-26 18:42:33,833 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12da4c72 and model type interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:33, skipping insertion in model container [2025-04-26 18:42:33,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:33,833 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:33" (2/2) ... [2025-04-26 18:42:33,834 INFO L376 chiAutomizerObserver]: Analyzing ICFG interleaved3.c.bpl [2025-04-26 18:42:33,881 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:33,922 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:33,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:33,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,924 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 18:42:33,925 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 18:42:33,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:42:33,983 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 18:42:33,984 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:33,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 18:42:33,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:42:33,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 18:42:33,990 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 18:42:33,990 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2025-04-26 18:42:34,032 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 304 states, 303 states have (on average 2.943894389438944) internal successors, (in total 892), 303 states have internal predecessors, (892), 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 18:42:34,033 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 304 states, 303 states have (on average 2.943894389438944) internal successors, (in total 892), 303 states have internal predecessors, (892), 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 18:42:34,035 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:34,122 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 643#[L63, L16, L29, L48]true [2025-04-26 18:42:34,123 WARN L140 AmpleReduction]: Number of pruned transitions: 206 [2025-04-26 18:42:34,123 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 18:42:34,123 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 18 [2025-04-26 18:42:34,123 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:33 [2025-04-26 18:42:34,123 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:137 [2025-04-26 18:42:34,123 WARN L145 AmpleReduction]: Times succ was already a loop node:20 [2025-04-26 18:42:34,123 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:37 [2025-04-26 18:42:34,123 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:34,125 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (in total 276), 187 states have internal predecessors, (276), 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 18:42:34,131 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:34,131 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:34,132 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:34,132 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:34,132 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:34,132 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:34,132 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:34,132 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:34,134 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (in total 276), 187 states have internal predecessors, (276), 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 18:42:34,146 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 140 [2025-04-26 18:42:34,147 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:34,147 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:34,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:34,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:34,150 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:34,150 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (in total 276), 187 states have internal predecessors, (276), 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 18:42:34,153 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 140 [2025-04-26 18:42:34,153 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:34,153 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:34,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:34,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:34,157 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L14: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} OutVars{x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} AuxVars[] AssignedVars[]" "[93] L14-->L29-1: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:34,158 INFO L754 eck$LassoCheckResult]: Loop: "[68] L29-1-->L27: 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[]" "[70] L27-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[71] L28-->L29: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[72] L29-->L29-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 18:42:34,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,163 INFO L85 PathProgramCache]: Analyzing trace with hash 3007, now seen corresponding path program 1 times [2025-04-26 18:42:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:34,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825115961] [2025-04-26 18:42:34,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:34,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:34,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:34,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,232 INFO L85 PathProgramCache]: Analyzing trace with hash 3018852, now seen corresponding path program 1 times [2025-04-26 18:42:34,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:34,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989142538] [2025-04-26 18:42:34,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:34,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:34,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:34,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:34,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:34,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:34,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:34,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:34,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1515844318, now seen corresponding path program 1 times [2025-04-26 18:42:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:34,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934771833] [2025-04-26 18:42:34,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:34,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:34,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:34,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:34,341 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 18:42:34,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:34,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934771833] [2025-04-26 18:42:34,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934771833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:34,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:34,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:42:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381098580] [2025-04-26 18:42:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:34,416 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:34,416 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:34,417 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:34,417 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:34,417 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:34,417 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,417 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:34,417 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:34,417 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:34,417 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:34,417 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:34,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,549 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:34,550 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:34,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,555 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 18:42:34,560 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 18:42:34,561 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:34,561 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:34,610 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:34,610 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f2=1} Honda state: {f2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:34,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:34,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,624 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 18:42:34,625 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 18:42:34,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:34,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:34,642 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 18:42:34,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,644 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 18:42:34,645 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 18:42:34,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:34,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:34,672 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:34,676 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 18:42:34,676 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:34,676 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:34,676 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:34,677 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:34,677 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:34,677 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,677 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:34,677 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:34,677 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:34,677 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:34,677 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:34,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,729 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:34,731 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:34,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,734 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 18:42:34,736 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 18:42:34,738 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 18:42:34,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:34,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:34,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:34,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:34,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:34,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:34,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:34,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:34,759 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:34,759 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:34,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,784 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 18:42:34,785 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 18:42:34,787 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:34,789 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 18:42:34,790 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:34,790 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:34,790 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f1) = 1*f1 Supporting invariants [] [2025-04-26 18:42:34,795 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 18:42:34,797 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:34,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:34,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:34,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:34,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:34,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:34,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:34,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:34,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:34,843 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 18:42:34,857 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 18:42:34,859 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (in total 276), 187 states have internal predecessors, (276), 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 18:42:34,927 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (in total 276), 187 states have internal predecessors, (276), 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 494 states and 714 transitions. Complement of second has 5 states. [2025-04-26 18:42:34,931 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 18:42:34,934 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 18:42:34,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 18:42:34,938 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:34,938 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:34,938 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:34,938 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:34,938 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 18:42:34,938 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:34,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 714 transitions. [2025-04-26 18:42:34,944 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 172 [2025-04-26 18:42:34,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 348 states and 498 transitions. [2025-04-26 18:42:34,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 246 [2025-04-26 18:42:34,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 268 [2025-04-26 18:42:34,951 INFO L74 IsDeterministic]: Start isDeterministic. Operand 348 states and 498 transitions. [2025-04-26 18:42:34,953 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:34,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 348 states and 498 transitions. [2025-04-26 18:42:34,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states and 498 transitions. [2025-04-26 18:42:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 297. [2025-04-26 18:42:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 297 states have (on average 1.468013468013468) internal successors, (in total 436), 296 states have internal predecessors, (436), 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 18:42:34,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 436 transitions. [2025-04-26 18:42:34,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 297 states and 436 transitions. [2025-04-26 18:42:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:34,981 INFO L87 Difference]: Start difference. First operand 297 states and 436 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 18:42:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:35,001 INFO L93 Difference]: Finished difference Result 337 states and 462 transitions. [2025-04-26 18:42:35,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 337 states and 462 transitions. [2025-04-26 18:42:35,004 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 173 [2025-04-26 18:42:35,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 337 states to 258 states and 357 transitions. [2025-04-26 18:42:35,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2025-04-26 18:42:35,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2025-04-26 18:42:35,006 INFO L74 IsDeterministic]: Start isDeterministic. Operand 258 states and 357 transitions. [2025-04-26 18:42:35,007 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:35,007 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258 states and 357 transitions. [2025-04-26 18:42:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 357 transitions. [2025-04-26 18:42:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 184. [2025-04-26 18:42:35,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 1.4076086956521738) internal successors, (in total 259), 183 states have internal predecessors, (259), 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 18:42:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2025-04-26 18:42:35,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 184 states and 259 transitions. [2025-04-26 18:42:35,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:35,013 INFO L438 stractBuchiCegarLoop]: Abstraction has 184 states and 259 transitions. [2025-04-26 18:42:35,013 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:35,013 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 259 transitions. [2025-04-26 18:42:35,015 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 129 [2025-04-26 18:42:35,015 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:35,016 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:35,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:35,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:35,016 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L14: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} OutVars{x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} AuxVars[] AssignedVars[]" "[93] L14-->L29-1: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[67] L29-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[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[87] L14-1-->L40: 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 18:42:35,016 INFO L754 eck$LassoCheckResult]: Loop: "[74] L40-->L42: 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[]" "[76] L42-->L42-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[77] L42-1-->L48: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[78] L48-->L40: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" [2025-04-26 18:42:35,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,017 INFO L85 PathProgramCache]: Analyzing trace with hash 89648150, now seen corresponding path program 1 times [2025-04-26 18:42:35,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451459829] [2025-04-26 18:42:35,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:35,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:35,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:35,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:35,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 1 times [2025-04-26 18:42:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504161216] [2025-04-26 18:42:35,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,036 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2133148807, now seen corresponding path program 1 times [2025-04-26 18:42:35,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131250207] [2025-04-26 18:42:35,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:35,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:35,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,065 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 18:42:35,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:35,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131250207] [2025-04-26 18:42:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131250207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:35,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783773887] [2025-04-26 18:42:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:35,101 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,101 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:35,101 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,101 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,101 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,101 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:35,101 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,101 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,146 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,146 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:35,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,150 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 18:42:35,151 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 18:42:35,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:35,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,163 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:35,164 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f3=1} Honda state: {f3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:35,169 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 18:42:35,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,171 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 18:42:35,171 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 18:42:35,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:35,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,188 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 18:42:35,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,190 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 18:42:35,191 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 18:42:35,192 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:35,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,225 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:35,259 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 18:42:35,259 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,259 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,260 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,260 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,260 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:35,260 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,260 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,260 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,260 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:35,260 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,260 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,268 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,302 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,302 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:35,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,304 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 18:42:35,305 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 18:42:35,306 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 18:42:35,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:35,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:35,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:35,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:35,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:35,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:35,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:35,319 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:35,321 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:35,321 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,323 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 18:42:35,324 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 18:42:35,325 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:35,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:35,328 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:35,329 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:35,329 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f2) = 1*f2 Supporting invariants [] [2025-04-26 18:42:35,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:35,335 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:35,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:35,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:35,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,397 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 18:42:35,397 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 18:42:35,398 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 184 states and 259 transitions. cyclomatic complexity: 94 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 18:42:35,426 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 184 states and 259 transitions. cyclomatic complexity: 94. 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 533 states and 745 transitions. Complement of second has 5 states. [2025-04-26 18:42:35,426 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 18:42:35,427 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 18:42:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-26 18:42:35,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:35,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:35,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 18:42:35,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 533 states and 745 transitions. [2025-04-26 18:42:35,433 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 161 [2025-04-26 18:42:35,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 533 states to 397 states and 560 transitions. [2025-04-26 18:42:35,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 289 [2025-04-26 18:42:35,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 308 [2025-04-26 18:42:35,436 INFO L74 IsDeterministic]: Start isDeterministic. Operand 397 states and 560 transitions. [2025-04-26 18:42:35,437 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:35,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 397 states and 560 transitions. [2025-04-26 18:42:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states and 560 transitions. [2025-04-26 18:42:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 337. [2025-04-26 18:42:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 337 states have (on average 1.4391691394658754) internal successors, (in total 485), 336 states have internal predecessors, (485), 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 18:42:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 485 transitions. [2025-04-26 18:42:35,449 INFO L240 hiAutomatonCegarLoop]: Abstraction has 337 states and 485 transitions. [2025-04-26 18:42:35,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:35,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:35,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:35,450 INFO L87 Difference]: Start difference. First operand 337 states and 485 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 18:42:35,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:35,477 INFO L93 Difference]: Finished difference Result 483 states and 654 transitions. [2025-04-26 18:42:35,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 483 states and 654 transitions. [2025-04-26 18:42:35,479 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 166 [2025-04-26 18:42:35,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 483 states to 326 states and 442 transitions. [2025-04-26 18:42:35,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 297 [2025-04-26 18:42:35,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 317 [2025-04-26 18:42:35,482 INFO L74 IsDeterministic]: Start isDeterministic. Operand 326 states and 442 transitions. [2025-04-26 18:42:35,485 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:35,485 INFO L218 hiAutomatonCegarLoop]: Abstraction has 326 states and 442 transitions. [2025-04-26 18:42:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states and 442 transitions. [2025-04-26 18:42:35,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 196. [2025-04-26 18:42:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 1.403061224489796) internal successors, (in total 275), 195 states have internal predecessors, (275), 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 18:42:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2025-04-26 18:42:35,489 INFO L240 hiAutomatonCegarLoop]: Abstraction has 196 states and 275 transitions. [2025-04-26 18:42:35,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:35,492 INFO L438 stractBuchiCegarLoop]: Abstraction has 196 states and 275 transitions. [2025-04-26 18:42:35,492 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:35,492 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 275 transitions. [2025-04-26 18:42:35,492 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 122 [2025-04-26 18:42:35,492 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:35,493 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:35,493 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:35,493 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:42:35,493 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L14: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} OutVars{x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} AuxVars[] AssignedVars[]" "[93] L14-->L29-1: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[67] L29-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[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[87] L14-1-->L40: 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]" "[73] L40-->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[]" "[75] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] L15-->L55: 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 18:42:35,493 INFO L754 eck$LassoCheckResult]: Loop: "[80] L55-->L57: 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[]" "[82] L57-->L57-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[83] L57-1-->L63: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[84] L63-->L55: Formula: (= v_f1_3 1) InVars {} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[f1]" [2025-04-26 18:42:35,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,493 INFO L85 PathProgramCache]: Analyzing trace with hash -761548894, now seen corresponding path program 1 times [2025-04-26 18:42:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425992979] [2025-04-26 18:42:35,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:35,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:35,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:35,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:35,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,502 INFO L85 PathProgramCache]: Analyzing trace with hash 3388260, now seen corresponding path program 1 times [2025-04-26 18:42:35,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464399372] [2025-04-26 18:42:35,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1203983739, now seen corresponding path program 1 times [2025-04-26 18:42:35,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796585268] [2025-04-26 18:42:35,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:35,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:35,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,541 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 18:42:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:35,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796585268] [2025-04-26 18:42:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796585268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:35,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:35,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269475647] [2025-04-26 18:42:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:35,571 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,571 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,571 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,571 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,571 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:35,571 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,571 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:35,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,571 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,613 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,613 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:35,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,617 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 18:42:35,618 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 18:42:35,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:35,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,637 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 18:42:35,638 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 18:42:35,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:35,639 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,662 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:35,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:35,666 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,667 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,667 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,667 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,667 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:35,667 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,667 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,667 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,667 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:35,667 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,667 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,713 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,713 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:35,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,715 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 18:42:35,717 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 18:42:35,718 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 18:42:35,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:35,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:35,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:35,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:35,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:35,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:35,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:35,732 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:35,733 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:42:35,733 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,735 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 18:42:35,736 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 18:42:35,737 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:35,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:35,741 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:35,741 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:35,741 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(f3) = 1*f3 Supporting invariants [] [2025-04-26 18:42:35,746 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 18:42:35,747 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:35,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:35,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:35,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,840 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 18:42:35,840 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 18:42:35,840 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 196 states and 275 transitions. cyclomatic complexity: 89 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 18:42:35,870 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 196 states and 275 transitions. cyclomatic complexity: 89. 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 432 states and 594 transitions. Complement of second has 5 states. [2025-04-26 18:42:35,871 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 18:42:35,872 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 18:42:35,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-04-26 18:42:35,872 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:42:35,872 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,873 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:42:35,873 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,873 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 18:42:35,873 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 432 states and 594 transitions. [2025-04-26 18:42:35,875 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 122 [2025-04-26 18:42:35,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 432 states to 365 states and 511 transitions. [2025-04-26 18:42:35,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 244 [2025-04-26 18:42:35,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2025-04-26 18:42:35,878 INFO L74 IsDeterministic]: Start isDeterministic. Operand 365 states and 511 transitions. [2025-04-26 18:42:35,878 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:35,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 365 states and 511 transitions. [2025-04-26 18:42:35,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 511 transitions. [2025-04-26 18:42:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 359. [2025-04-26 18:42:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 359 states have (on average 1.3983286908077994) internal successors, (in total 502), 358 states have internal predecessors, (502), 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 18:42:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 502 transitions. [2025-04-26 18:42:35,884 INFO L240 hiAutomatonCegarLoop]: Abstraction has 359 states and 502 transitions. [2025-04-26 18:42:35,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:35,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:35,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:35,885 INFO L87 Difference]: Start difference. First operand 359 states and 502 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 18:42:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:35,897 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2025-04-26 18:42:35,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 69 transitions. [2025-04-26 18:42:35,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-04-26 18:42:35,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 42 states and 46 transitions. [2025-04-26 18:42:35,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-04-26 18:42:35,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-04-26 18:42:35,898 INFO L74 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2025-04-26 18:42:35,898 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:35,898 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-04-26 18:42:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2025-04-26 18:42:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 29. [2025-04-26 18:42:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (in total 32), 28 states have internal predecessors, (32), 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 18:42:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2025-04-26 18:42:35,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-04-26 18:42:35,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:35,902 INFO L438 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2025-04-26 18:42:35,902 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:35,902 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2025-04-26 18:42:35,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2025-04-26 18:42:35,902 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:35,902 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:35,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:35,902 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:35,903 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L14: Formula: (and (= v_f3_4 0) (= v_f2_4 0) (= v_x3_5 0) (= v_x1_5 0) (= v_x2_5 0) (= v_f1_4 0)) InVars {x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} OutVars{x1=v_x1_5, f2=v_f2_4, f3=v_f3_4, x2=v_x2_5, f1=v_f1_4, x3=v_x3_5} AuxVars[] AssignedVars[]" "[93] L14-->L29-1: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[68] L29-1-->L27: 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[]" "[70] L27-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[87] L14-1-->L40: 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]" "[74] L40-->L42: 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[]" "[71] L28-->L29: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" "[90] L15-->L55: 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]" "[80] L55-->L57: 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 18:42:35,903 INFO L754 eck$LassoCheckResult]: Loop: "[76] L42-->L42-1: Formula: (and (< 0 v_f2_6) (= v_f2_5 0)) InVars {f2=v_f2_6} OutVars{f2=v_f2_5} AuxVars[] AssignedVars[f2]" "[77] L42-1-->L48: Formula: (= v_x2_3 (+ v_x2_4 1)) InVars {x2=v_x2_4} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[x2]" "[78] L48-->L40: Formula: (= v_f3_1 1) InVars {} OutVars{f3=v_f3_1} AuxVars[] AssignedVars[f3]" "[74] L40-->L42: 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[]" "[82] L57-->L57-1: Formula: (and (< 0 v_f3_6) (= v_f3_5 0)) InVars {f3=v_f3_6} OutVars{f3=v_f3_5} AuxVars[] AssignedVars[f3]" "[83] L57-1-->L63: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[84] L63-->L55: Formula: (= v_f1_3 1) InVars {} OutVars{f1=v_f1_3} AuxVars[] AssignedVars[f1]" "[80] L55-->L57: 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[]" "[72] L29-->L29-1: Formula: (and (< 0 v_f1_6) (= v_f1_5 0)) InVars {f1=v_f1_6} OutVars{f1=v_f1_5} AuxVars[] AssignedVars[f1]" "[68] L29-1-->L27: 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[]" "[70] L27-->L28: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[71] L28-->L29: Formula: (= v_f2_1 1) InVars {} OutVars{f2=v_f2_1} AuxVars[] AssignedVars[f2]" [2025-04-26 18:42:35,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1217020375, now seen corresponding path program 1 times [2025-04-26 18:42:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104015641] [2025-04-26 18:42:35,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:35,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:35,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:35,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:35,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1255683384, now seen corresponding path program 1 times [2025-04-26 18:42:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559502752] [2025-04-26 18:42:35,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:35,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:35,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:35,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:35,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -31852704, now seen corresponding path program 1 times [2025-04-26 18:42:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776228410] [2025-04-26 18:42:35,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:42:35,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:42:35,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,940 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 18:42:35,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 18:42:35,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:36,035 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:36,035 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:36,035 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:36,036 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:36,036 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:36,036 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,036 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:36,036 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:36,036 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:36,036 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:36,036 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:36,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,112 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:36,112 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:36,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,119 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 18:42:36,119 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 18:42:36,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:36,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:36,131 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:36,131 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f3=0} Honda state: {f3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:36,137 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 18:42:36,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,139 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 18:42:36,139 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 18:42:36,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:36,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:36,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:42:36,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,160 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 18:42:36,161 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 18:42:36,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:36,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:36,356 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:36,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:42:36,363 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:36,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:36,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:36,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:36,363 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:36,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:36,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:36,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: interleaved3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:36,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:36,363 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:36,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,376 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,384 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,443 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:36,443 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,446 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 18:42:36,447 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 18:42:36,448 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 18:42:36,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:36,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:36,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:36,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:36,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:36,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:36,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:36,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:36,470 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:36,471 INFO L437 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:36,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,473 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 18:42:36,474 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 18:42:36,475 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:36,479 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 18:42:36,479 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:36,479 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:36,479 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 18:42:36,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:36,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:36,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:36,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:36,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:36,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:36,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:36,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:36,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:36,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:36,572 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 18:42:36,572 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 18:42:36,572 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (in total 21), 5 states have internal predecessors, (21), 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 18:42:36,595 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (in total 21), 5 states have internal predecessors, (21), 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 46 states and 52 transitions. Complement of second has 6 states. [2025-04-26 18:42:36,595 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 18:42:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (in total 21), 5 states have internal predecessors, (21), 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 18:42:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2025-04-26 18:42:36,595 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 12 letters. [2025-04-26 18:42:36,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,596 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 21 letters. Loop has 12 letters. [2025-04-26 18:42:36,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,596 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 9 letters. Loop has 24 letters. [2025-04-26 18:42:36,596 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 52 transitions. [2025-04-26 18:42:36,596 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:36,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2025-04-26 18:42:36,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:36,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:36,597 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:36,597 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:36,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:36,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:36,597 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:36,597 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:36,597 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:36,597 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:36,597 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:36,611 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 18:42:36,612 INFO L201 PluginConnector]: Adding new model interleaved3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:36 BoogieIcfgContainer [2025-04-26 18:42:36,612 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:36,613 INFO L158 Benchmark]: Toolchain (without parser) took 3023.40ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 94.5MB in the beginning and 52.9MB in the end (delta: 41.5MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,613 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:36,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.86ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 92.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:36,614 INFO L158 Benchmark]: Boogie Preprocessor took 22.70ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 91.7MB in the end (delta: 814.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,614 INFO L158 Benchmark]: RCFGBuilder took 175.52ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 81.9MB in the end (delta: 9.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,614 INFO L158 Benchmark]: BuchiAutomizer took 2786.49ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 81.7MB in the beginning and 52.9MB in the end (delta: 28.7MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,615 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.14ms. Allocated memory is still 167.8MB. Free memory is still 95.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.86ms. Allocated memory is still 167.8MB. Free memory was 94.5MB in the beginning and 92.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.70ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 91.7MB in the end (delta: 814.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 175.52ms. Allocated memory is still 167.8MB. Free memory was 91.4MB in the beginning and 81.9MB in the end (delta: 9.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 2786.49ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 81.7MB in the beginning and 52.9MB in the end (delta: 28.7MB). Peak memory consumption was 6.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 334 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 192 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 117 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital26 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf109 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 58ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 205, Number of transitions in reduction automaton: 276, Number of states in reduction automaton: 188, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 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 * x3 + z and consists of 4 locations. 3 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 18:42:36,626 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...