/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/m7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:44:01,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:44:01,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:44:01,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:44:01,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:44:01,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:44:01,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:44:01,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:44:01,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:44:01,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:44:01,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:44:01,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:44:01,117 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:44:01,117 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:44:01,117 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:44:01,117 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:44:01,117 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:44:01,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:44:01,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:44:01,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:44:01,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:44:01,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:01,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:44:01,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:44:01,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:44:01,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:44:01,119 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:44:01,119 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:44:01,119 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:44:01,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:44:01,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:44:01,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:44:01,372 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:44:01,372 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:44:01,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/m7.c.bpl [2025-04-26 18:44:01,373 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/m7.c.bpl' [2025-04-26 18:44:01,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:44:01,387 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:44:01,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:01,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:44:01,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:44:01,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,424 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:44:01,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:01,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:44:01,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:44:01,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:44:01,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:44:01,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:44:01,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:44:01,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:44:01,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/1) ... [2025-04-26 18:44:01,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,476 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:44:01,483 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:44:01,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:44:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:44:01,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:44:01,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:44:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:44:01,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:44:01,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:44:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:44:01,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:44:01,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:44:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:44:01,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:44:01,506 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:44:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:44:01,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:44:01,507 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:44:01,547 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:44:01,549 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:44:01,640 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:44:01,640 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:44:01,653 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:44:01,653 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:44:01,654 INFO L201 PluginConnector]: Adding new model m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:01 BoogieIcfgContainer [2025-04-26 18:44:01,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:44:01,659 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:44:01,659 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:44:01,664 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:44:01,665 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:01,665 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:01" (1/2) ... [2025-04-26 18:44:01,668 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@49ef1089 and model type m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:44:01, skipping insertion in model container [2025-04-26 18:44:01,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:01,668 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:01" (2/2) ... [2025-04-26 18:44:01,670 INFO L376 chiAutomizerObserver]: Analyzing ICFG m7.c.bpl [2025-04-26 18:44:01,733 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:44:01,788 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:44:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:44:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:01,795 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:44:01,797 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:44:01,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 36 transitions, 100 flow [2025-04-26 18:44:01,881 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 18:44:01,883 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:44:01,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 18:44:01,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 36 transitions, 100 flow [2025-04-26 18:44:01,892 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 28 transitions, 80 flow [2025-04-26 18:44:01,893 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 28 transitions, 80 flow [2025-04-26 18:44:01,895 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 80 flow [2025-04-26 18:44:01,968 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 634 states, 633 states have (on average 3.8941548183254344) internal successors, (in total 2465), 633 states have internal predecessors, (2465), 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:44:01,970 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 634 states, 633 states have (on average 3.8941548183254344) internal successors, (in total 2465), 633 states have internal predecessors, (2465), 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:44:01,973 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:44:02,154 WARN L140 AmpleReduction]: Number of pruned transitions: 868 [2025-04-26 18:44:02,154 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:44:02,154 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 191 [2025-04-26 18:44:02,154 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:31 [2025-04-26 18:44:02,154 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:331 [2025-04-26 18:44:02,154 WARN L145 AmpleReduction]: Times succ was already a loop node:393 [2025-04-26 18:44:02,155 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:40 [2025-04-26 18:44:02,155 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:44:02,161 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 554 states, 553 states have (on average 2.3236889692585896) internal successors, (in total 1285), 553 states have internal predecessors, (1285), 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:44:02,169 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:44:02,170 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:44:02,170 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:44:02,170 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:44:02,170 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:44:02,170 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:44:02,170 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:44:02,170 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:44:02,198 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 554 states, 553 states have (on average 2.3236889692585896) internal successors, (in total 1285), 553 states have internal predecessors, (1285), 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:44:02,227 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 398 [2025-04-26 18:44:02,228 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:02,228 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:02,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:02,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:02,236 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:44:02,237 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 554 states, 553 states have (on average 2.3236889692585896) internal successors, (in total 1285), 553 states have internal predecessors, (1285), 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:44:02,252 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 398 [2025-04-26 18:44:02,252 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:02,252 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:02,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:02,253 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:02,258 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:44:02,258 INFO L754 eck$LassoCheckResult]: Loop: "[70] L26-->L28: 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[]" "[72] L28-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:02,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2972, now seen corresponding path program 1 times [2025-04-26 18:44:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021023536] [2025-04-26 18:44:02,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,341 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2025-04-26 18:44:02,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024489166] [2025-04-26 18:44:02,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,366 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2858334, now seen corresponding path program 1 times [2025-04-26 18:44:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:02,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796998616] [2025-04-26 18:44:02,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:02,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:02,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:02,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:02,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:02,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:02,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:02,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:02,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:02,423 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:02,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:02,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:02,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:02,424 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:02,424 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,424 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:02,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:02,425 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:02,425 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:02,425 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:02,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,494 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:02,495 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:02,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,498 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:44:02,501 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:44:02,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:02,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:44:02,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,531 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:44:02,532 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:44:02,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:02,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:02,605 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:02,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:44:02,610 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:02,611 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:02,611 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:02,611 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:02,611 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:02,611 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,611 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:02,611 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:02,611 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:02,611 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:02,611 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:02,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:02,636 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:02,657 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:02,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,665 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:44:02,670 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:44:02,672 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:44:02,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:02,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:02,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:02,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:02,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:02,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:02,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:02,720 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:02,727 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:02,727 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:02,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:02,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:02,731 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:44:02,733 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:44:02,733 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:02,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:44:02,737 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:02,737 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:02,738 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:44:02,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:44:02,746 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:02,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:02,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:02,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:02,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:02,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:02,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:02,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:02,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:02,804 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:02,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:02,824 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:44:02,846 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:44:02,849 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 554 states, 553 states have (on average 2.3236889692585896) internal successors, (in total 1285), 553 states have internal predecessors, (1285), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:44:02,975 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 554 states, 553 states have (on average 2.3236889692585896) internal successors, (in total 1285), 553 states have internal predecessors, (1285), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 1732 states and 3983 transitions. Complement of second has 7 states. [2025-04-26 18:44:02,976 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:44:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:44:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:44:02,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:44:02,985 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:44:02,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:44:02,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:02,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1732 states and 3983 transitions. [2025-04-26 18:44:03,004 INFO L131 ngComponentsAnalysis]: Automaton has 186 accepting balls. 540 [2025-04-26 18:44:03,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1732 states to 1212 states and 2870 transitions. [2025-04-26 18:44:03,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 851 [2025-04-26 18:44:03,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 967 [2025-04-26 18:44:03,024 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1212 states and 2870 transitions. [2025-04-26 18:44:03,024 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:03,024 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1212 states and 2870 transitions. [2025-04-26 18:44:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states and 2870 transitions. [2025-04-26 18:44:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 862. [2025-04-26 18:44:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 862 states have (on average 2.448955916473318) internal successors, (in total 2111), 861 states have internal predecessors, (2111), 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:44:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2111 transitions. [2025-04-26 18:44:03,100 INFO L240 hiAutomatonCegarLoop]: Abstraction has 862 states and 2111 transitions. [2025-04-26 18:44:03,100 INFO L438 stractBuchiCegarLoop]: Abstraction has 862 states and 2111 transitions. [2025-04-26 18:44:03,100 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:44:03,100 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 862 states and 2111 transitions. [2025-04-26 18:44:03,104 INFO L131 ngComponentsAnalysis]: Automaton has 146 accepting balls. 446 [2025-04-26 18:44:03,105 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:03,105 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:03,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:44:03,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:03,105 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L13-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L14-->L46: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:44:03,105 INFO L754 eck$LassoCheckResult]: Loop: "[80] L46-->L48: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[82] L48-->L46: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:03,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2859039, now seen corresponding path program 1 times [2025-04-26 18:44:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240287492] [2025-04-26 18:44:03,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:03,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:03,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:03,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:03,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 18:44:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528250642] [2025-04-26 18:44:03,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1547428255, now seen corresponding path program 1 times [2025-04-26 18:44:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263281122] [2025-04-26 18:44:03,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:03,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:03,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,124 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:03,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:03,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,141 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,141 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,141 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,141 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,141 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:03,141 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,141 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,141 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:03,141 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,141 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,165 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,165 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,168 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:44:03,169 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:44:03,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:03,172 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,194 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:44:03,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,199 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:44:03,201 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:44:03,201 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:03,201 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,270 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:03,274 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:44:03,274 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,275 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,275 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,275 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,275 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:03,275 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,275 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,275 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,275 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:03,275 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,275 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,294 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,294 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:03,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,296 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:44:03,298 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:44:03,298 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:44:03,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:03,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:03,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:03,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:03,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:03,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:03,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:03,312 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:03,315 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:03,315 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,320 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:44:03,322 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:44:03,323 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:03,326 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:03,327 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:44:03,328 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:03,328 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:03,328 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 18:44:03,333 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:44:03,334 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:03,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:03,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:03,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,366 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,389 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:44:03,389 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:44:03,390 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 862 states and 2111 transitions. cyclomatic complexity: 1441 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:44:03,480 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 862 states and 2111 transitions. cyclomatic complexity: 1441. 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 2033 states and 5063 transitions. Complement of second has 6 states. [2025-04-26 18:44:03,482 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:44:03,482 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:44:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 18:44:03,482 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:44:03,483 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,483 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:44:03,483 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,483 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:44:03,483 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2033 states and 5063 transitions. [2025-04-26 18:44:03,507 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 282 [2025-04-26 18:44:03,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2033 states to 1268 states and 3098 transitions. [2025-04-26 18:44:03,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 492 [2025-04-26 18:44:03,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 654 [2025-04-26 18:44:03,524 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1268 states and 3098 transitions. [2025-04-26 18:44:03,524 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:03,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1268 states and 3098 transitions. [2025-04-26 18:44:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states and 3098 transitions. [2025-04-26 18:44:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 1145. [2025-04-26 18:44:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1145 states have (on average 2.449781659388646) internal successors, (in total 2805), 1144 states have internal predecessors, (2805), 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:44:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 2805 transitions. [2025-04-26 18:44:03,574 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1145 states and 2805 transitions. [2025-04-26 18:44:03,574 INFO L438 stractBuchiCegarLoop]: Abstraction has 1145 states and 2805 transitions. [2025-04-26 18:44:03,574 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:03,574 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1145 states and 2805 transitions. [2025-04-26 18:44:03,580 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 282 [2025-04-26 18:44:03,581 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:03,581 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:03,581 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:44:03,581 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:03,581 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L13-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[69] L26-->L30: 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[]" "[71] L30-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[74] $Ultimate##0-->L37-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 18:44:03,581 INFO L754 eck$LassoCheckResult]: Loop: "[76] L37-1-->L39: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[78] L39-->L37-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:03,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1547453528, now seen corresponding path program 1 times [2025-04-26 18:44:03,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029902034] [2025-04-26 18:44:03,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:03,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:03,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:03,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 18:44:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429949045] [2025-04-26 18:44:03,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1044153558, now seen corresponding path program 1 times [2025-04-26 18:44:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:03,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330868063] [2025-04-26 18:44:03,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:03,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:03,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:03,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:03,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:03,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:03,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:03,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:03,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:03,625 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,625 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,625 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:03,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,626 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:03,626 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,626 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,642 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,642 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:03,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,645 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:44:03,648 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:44:03,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:03,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,667 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:44:03,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,669 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:44:03,670 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:44:03,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:03,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:03,746 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:03,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:03,752 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:03,752 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:03,752 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:03,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:03,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:03,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,752 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:03,752 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:03,752 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:03,752 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:03,753 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:03,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:03,771 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:03,772 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:03,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,774 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:44:03,775 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:44:03,776 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:44:03,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:03,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:03,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:03,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:03,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:03,789 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:03,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:03,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:03,795 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:03,795 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:03,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:03,797 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:44:03,798 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:44:03,799 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:03,802 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:44:03,802 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:03,802 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:03,802 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 18:44:03,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:44:03,809 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:03,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:03,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:44:03,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:44:03,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:03,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:03,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:03,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:03,843 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:03,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:03,858 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:44:03,858 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:44:03,859 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1145 states and 2805 transitions. cyclomatic complexity: 1876 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:44:03,949 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1145 states and 2805 transitions. cyclomatic complexity: 1876. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 3506 states and 8465 transitions. Complement of second has 7 states. [2025-04-26 18:44:03,949 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:44:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:44:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 18:44:03,950 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:44:03,950 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,950 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:44:03,950 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,950 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:44:03,950 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:03,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3506 states and 8465 transitions. [2025-04-26 18:44:03,978 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 344 [2025-04-26 18:44:03,997 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3506 states to 2484 states and 5993 transitions. [2025-04-26 18:44:03,997 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 849 [2025-04-26 18:44:03,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 943 [2025-04-26 18:44:03,999 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2484 states and 5993 transitions. [2025-04-26 18:44:03,999 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:03,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2484 states and 5993 transitions. [2025-04-26 18:44:04,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states and 5993 transitions. [2025-04-26 18:44:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1808. [2025-04-26 18:44:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1808 states have (on average 2.496128318584071) internal successors, (in total 4513), 1807 states have internal predecessors, (4513), 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:44:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 4513 transitions. [2025-04-26 18:44:04,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1808 states and 4513 transitions. [2025-04-26 18:44:04,080 INFO L438 stractBuchiCegarLoop]: Abstraction has 1808 states and 4513 transitions. [2025-04-26 18:44:04,080 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:04,080 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1808 states and 4513 transitions. [2025-04-26 18:44:04,089 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 314 [2025-04-26 18:44:04,089 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:04,089 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:04,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:04,089 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:04,090 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L13-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] $Ultimate##0-->L37-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[76] L37-1-->L39: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[78] L39-->L37-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[75] L37-1-->thread2FINAL: Formula: (<= v_x1_8 v_y_2) InVars {y=v_y_2, x1=v_x1_8} OutVars{y=v_y_2, x1=v_x1_8} AuxVars[] AssignedVars[]" [2025-04-26 18:44:04,090 INFO L754 eck$LassoCheckResult]: Loop: "[70] L26-->L28: 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[]" "[72] L28-->L26: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:04,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash -726265153, now seen corresponding path program 1 times [2025-04-26 18:44:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697791565] [2025-04-26 18:44:04,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:04,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:04,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:44:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:04,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697791565] [2025-04-26 18:44:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697791565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:04,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:04,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:04,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845393314] [2025-04-26 18:44:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:04,136 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:04,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 2 times [2025-04-26 18:44:04,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498546910] [2025-04-26 18:44:04,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:04,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,142 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,173 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,173 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,173 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,173 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:04,173 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,173 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,173 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:04,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,174 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,191 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,191 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:04,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,193 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:44:04,195 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:44:04,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:04,197 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:44:04,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,221 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:44:04,222 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:44:04,223 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:04,224 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,294 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:04,299 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:44:04,299 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,299 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,299 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,299 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,299 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:04,300 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,300 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,300 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,300 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:04,300 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,300 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,321 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,321 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:04,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,323 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:44:04,325 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:44:04,327 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:44:04,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:04,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:04,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:04,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:04,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:04,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:04,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:04,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:04,344 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:04,344 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:04,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,346 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:44:04,349 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:44:04,349 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:04,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,354 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:04,354 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:04,354 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:44:04,361 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:44:04,362 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:04,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:04,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:04,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,407 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:44:04,408 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:44:04,408 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1808 states and 4513 transitions. cyclomatic complexity: 3014 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:44:04,469 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1808 states and 4513 transitions. cyclomatic complexity: 3014. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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 2666 states and 6678 transitions. Complement of second has 6 states. [2025-04-26 18:44:04,469 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:44:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 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:44:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-26 18:44:04,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:44:04,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:44:04,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,470 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 70 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:44:04,470 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2666 states and 6678 transitions. [2025-04-26 18:44:04,489 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 230 [2025-04-26 18:44:04,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2666 states to 2022 states and 4936 transitions. [2025-04-26 18:44:04,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 665 [2025-04-26 18:44:04,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 752 [2025-04-26 18:44:04,507 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2022 states and 4936 transitions. [2025-04-26 18:44:04,507 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:04,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2022 states and 4936 transitions. [2025-04-26 18:44:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states and 4936 transitions. [2025-04-26 18:44:04,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1804. [2025-04-26 18:44:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1804 states have (on average 2.5138580931263856) internal successors, (in total 4535), 1803 states have internal predecessors, (4535), 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:44:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 4535 transitions. [2025-04-26 18:44:04,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1804 states and 4535 transitions. [2025-04-26 18:44:04,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:04,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:04,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:04,550 INFO L87 Difference]: Start difference. First operand 1804 states and 4535 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:04,572 INFO L93 Difference]: Finished difference Result 466 states and 1125 transitions. [2025-04-26 18:44:04,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 466 states and 1125 transitions. [2025-04-26 18:44:04,575 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:44:04,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 466 states to 418 states and 1027 transitions. [2025-04-26 18:44:04,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2025-04-26 18:44:04,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2025-04-26 18:44:04,578 INFO L74 IsDeterministic]: Start isDeterministic. Operand 418 states and 1027 transitions. [2025-04-26 18:44:04,578 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:04,578 INFO L218 hiAutomatonCegarLoop]: Abstraction has 418 states and 1027 transitions. [2025-04-26 18:44:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 1027 transitions. [2025-04-26 18:44:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-04-26 18:44:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 2.4569377990430623) internal successors, (in total 1027), 417 states have internal predecessors, (1027), 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:44:04,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1027 transitions. [2025-04-26 18:44:04,610 INFO L240 hiAutomatonCegarLoop]: Abstraction has 418 states and 1027 transitions. [2025-04-26 18:44:04,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:04,612 INFO L438 stractBuchiCegarLoop]: Abstraction has 418 states and 1027 transitions. [2025-04-26 18:44:04,612 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:04,612 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 1027 transitions. [2025-04-26 18:44:04,614 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 38 [2025-04-26 18:44:04,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:04,614 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:04,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:04,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:04,615 INFO L752 eck$LassoCheckResult]: Stem: "[62] $Ultimate##0-->L13: Formula: (= v_f_4 0) InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[89] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[92] L13-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[95] L14-->L46: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[80] L46-->L48: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[98] L15-->L55: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[82] L48-->L46: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[79] L46-->thread3FINAL: Formula: (<= v_w_2 v_x2_4) InVars {x2=v_x2_4, w=v_w_2} OutVars{x2=v_x2_4, w=v_w_2} AuxVars[] AssignedVars[]" [2025-04-26 18:44:04,615 INFO L754 eck$LassoCheckResult]: Loop: "[84] L55-->L57: Formula: (< v_x3_1 v_w_3) InVars {w=v_w_3, x3=v_x3_1} OutVars{w=v_w_3, x3=v_x3_1} AuxVars[] AssignedVars[]" "[86] L57-->L55: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:44:04,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1019850642, now seen corresponding path program 1 times [2025-04-26 18:44:04,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913598125] [2025-04-26 18:44:04,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:04,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:04,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:04,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:04,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash 3651, now seen corresponding path program 1 times [2025-04-26 18:44:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929822100] [2025-04-26 18:44:04,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -823920784, now seen corresponding path program 1 times [2025-04-26 18:44:04,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:04,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77244281] [2025-04-26 18:44:04,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:04,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:04,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:04,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:44:04,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:44:04,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:04,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:04,666 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,666 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,666 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,666 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:04,666 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,666 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,666 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,666 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:04,666 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,666 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,682 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,683 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:04,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,685 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:44:04,686 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:44:04,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:04,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,707 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:44:04,709 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:44:04,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:04,710 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:04,779 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:04,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:44:04,785 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:04,785 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:04,785 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:04,785 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:04,785 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:04,785 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,785 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:04,785 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:04,785 INFO L132 ssoRankerPreferences]: Filename of dumped script: m7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:04,785 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:04,785 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:04,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:04,803 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:04,803 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,805 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:44:04,807 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:44:04,808 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:44:04,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:04,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:04,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:04,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:04,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:04,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:04,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:04,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:04,824 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:04,824 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:04,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:04,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:04,827 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:04,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:44:04,830 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:04,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:04,834 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:04,834 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:04,834 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x3) = 1*w - 1*x3 Supporting invariants [] [2025-04-26 18:44:04,841 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:44:04,842 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:04,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:04,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:44:04,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:44:04,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:04,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:04,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:04,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:04,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:04,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:04,898 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:44:04,899 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:44:04,899 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 1027 transitions. cyclomatic complexity: 677 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:44:04,932 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 1027 transitions. cyclomatic complexity: 677. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 807 states and 1903 transitions. Complement of second has 6 states. [2025-04-26 18:44:04,932 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:44:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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:44:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-26 18:44:04,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:44:04,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:44:04,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:44:04,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:04,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 807 states and 1903 transitions. [2025-04-26 18:44:04,937 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:04,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 807 states to 0 states and 0 transitions. [2025-04-26 18:44:04,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:44:04,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:44:04,937 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:44:04,937 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:44:04,937 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:04,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:04,937 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:04,937 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:04,938 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:44:04,938 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:04,938 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:44:04,948 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:04,949 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:44:04,950 INFO L201 PluginConnector]: Adding new model m7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:44:04 BoogieIcfgContainer [2025-04-26 18:44:04,950 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:44:04,951 INFO L158 Benchmark]: Toolchain (without parser) took 3563.42ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.7MB in the beginning and 69.9MB in the end (delta: 17.8MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2025-04-26 18:44:04,951 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory was 88.7MB in the beginning and 88.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:04,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.19ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 85.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:04,951 INFO L158 Benchmark]: Boogie Preprocessor took 19.10ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:04,951 INFO L158 Benchmark]: RCFGBuilder took 208.37ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 75.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:44:04,951 INFO L158 Benchmark]: BuchiAutomizer took 3291.22ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.7MB in the beginning and 69.9MB in the end (delta: 5.8MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. [2025-04-26 18:44:04,953 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.18ms. Allocated memory is still 159.4MB. Free memory was 88.7MB in the beginning and 88.5MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.19ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 85.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.10ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 84.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 208.37ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 75.7MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3291.22ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 75.7MB in the beginning and 69.9MB in the end (delta: 5.8MB). Peak memory consumption was 3.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 1367 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 255 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 164 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 205 IncrementalHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 173 mSDtfsCounter, 205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 79ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 373, Number of transitions in reduction automaton: 1285, Number of states in reduction automaton: 554, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + w and consists of 4 locations. 1 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:44:04,966 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...