/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/pc6v.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:59:00,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:59:00,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:59:00,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:59:00,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:59:00,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:59:00,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:59:00,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:59:00,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:59:00,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:59:00,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:59:00,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:59:00,553 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:59:00,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:59:00,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:59:00,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:59:00,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:59:00,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:59:00,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:59:00,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:59:00,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:59:00,555 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:59:00,555 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:59:00,555 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:59:00,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:59:00,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:59:00,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:59:00,802 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:59:00,802 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:59:00,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/pc6v.c.bpl [2025-04-26 16:59:00,804 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/pc6v.c.bpl' [2025-04-26 16:59:00,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:59:00,825 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:59:00,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:59:00,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:59:00,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:59:00,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,863 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:59:00,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:59:00,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:59:00,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:59:00,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:59:00,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:59:00,892 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:59:00,892 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:59:00,892 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:59:00,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/1) ... [2025-04-26 16:59:00,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:59:00,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:00,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:00,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:59:00,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:59:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:59:00,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:59:00,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:59:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:59:00,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:59:00,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:59:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:59:00,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:59:00,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:59:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:59:00,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:59:00,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:59:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:59:00,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:59:00,935 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:59:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:59:00,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:59:00,936 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:59:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:59:00,936 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:59:00,936 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:59:00,975 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:59:00,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:59:01,092 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:59:01,092 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:59:01,104 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:59:01,104 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:59:01,106 INFO L201 PluginConnector]: Adding new model pc6v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:59:01 BoogieIcfgContainer [2025-04-26 16:59:01,106 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:59:01,107 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:59:01,107 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:59:01,112 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:59:01,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:59:01,112 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:59:00" (1/2) ... [2025-04-26 16:59:01,114 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@89a7a70 and model type pc6v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:59:01, skipping insertion in model container [2025-04-26 16:59:01,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:59:01,114 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "pc6v.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:59:01" (2/2) ... [2025-04-26 16:59:01,115 INFO L376 chiAutomizerObserver]: Analyzing ICFG pc6v.c.bpl [2025-04-26 16:59:01,197 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:59:01,229 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:59:01,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:59:01,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:01,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:01,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:59:01,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 62 transitions, 166 flow [2025-04-26 16:59:01,309 INFO L116 PetriNetUnfolderBase]: 6/50 cut-off events. [2025-04-26 16:59:01,310 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:59:01,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 50 events. 6/50 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-04-26 16:59:01,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 62 transitions, 166 flow [2025-04-26 16:59:01,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 50 transitions, 136 flow [2025-04-26 16:59:01,317 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 63 places, 50 transitions, 136 flow [2025-04-26 16:59:01,323 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:59:08,274 WARN L140 AmpleReduction]: Number of pruned transitions: 230027 [2025-04-26 16:59:08,275 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:59:08,275 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 16276 [2025-04-26 16:59:08,275 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:43 [2025-04-26 16:59:08,275 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:48995 [2025-04-26 16:59:08,275 WARN L145 AmpleReduction]: Times succ was already a loop node:11332 [2025-04-26 16:59:08,275 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:44957 [2025-04-26 16:59:08,275 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:59:08,563 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 65315 states, 65314 states have (on average 2.4212879321431853) internal successors, (in total 158144), 65314 states have internal predecessors, (158144), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:08,570 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:59:08,570 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:59:08,570 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:59:08,570 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:59:08,570 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:59:08,570 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:59:08,570 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:59:08,570 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:59:08,654 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65315 states, 65314 states have (on average 2.4212879321431853) internal successors, (in total 158144), 65314 states have internal predecessors, (158144), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:09,810 INFO L131 ngComponentsAnalysis]: Automaton has 3318 accepting balls. 48846 [2025-04-26 16:59:09,813 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:09,813 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:09,818 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:59:09,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:09,819 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:59:09,913 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 65315 states, 65314 states have (on average 2.4212879321431853) internal successors, (in total 158144), 65314 states have internal predecessors, (158144), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:10,669 INFO L131 ngComponentsAnalysis]: Automaton has 3318 accepting balls. 48846 [2025-04-26 16:59:10,670 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:10,670 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:10,671 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:59:10,671 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:10,676 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L16: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[163] L16-->L33: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" [2025-04-26 16:59:10,676 INFO L754 eck$LassoCheckResult]: Loop: "[120] L33-->L35: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[122] L35-->L36: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[124] L36-->L33: Formula: (= (+ v_c_2 1) v_c_1) InVars {c=v_c_2} OutVars{c=v_c_1} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:10,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:10,680 INFO L85 PathProgramCache]: Analyzing trace with hash 3790, now seen corresponding path program 1 times [2025-04-26 16:59:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:10,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736553943] [2025-04-26 16:59:10,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:10,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:10,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:10,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:10,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:10,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:10,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:10,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:10,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:10,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:10,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:10,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:10,749 INFO L85 PathProgramCache]: Analyzing trace with hash 149017, now seen corresponding path program 1 times [2025-04-26 16:59:10,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:10,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436955472] [2025-04-26 16:59:10,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:10,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:10,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:10,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:10,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:10,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:10,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:10,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:10,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:10,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:10,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:10,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash 113027116, now seen corresponding path program 1 times [2025-04-26 16:59:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:10,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965768250] [2025-04-26 16:59:10,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:10,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:10,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:59:10,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:59:10,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:10,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:10,770 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:10,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:59:10,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:59:10,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:10,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:10,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:10,819 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:10,819 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:10,819 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:10,819 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:10,819 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:10,819 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:10,819 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:10,819 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:10,820 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:59:10,820 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:10,820 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:10,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:10,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:10,965 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:10,965 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:10,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:10,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:10,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:59:10,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:10,975 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:11,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:11,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:11,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:11,007 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:11,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:59:11,015 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:11,015 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:11,083 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:59:11,084 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:59:11,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:11,094 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:11,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:59:11,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:11,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:11,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:59:11,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:11,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:11,127 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:11,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:59:11,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:11,129 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:11,204 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:11,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:59:11,209 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:11,209 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:11,209 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:11,209 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:11,209 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:11,209 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:11,209 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:11,210 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:11,210 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:59:11,210 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:11,210 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:11,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:11,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:11,248 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:11,255 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:11,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:11,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:11,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:11,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:59:11,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:11,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:11,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:11,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:11,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:11,293 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:11,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:11,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:59:11,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:11,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:11,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:11,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:59:11,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:11,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:11,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:11,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:11,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:11,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:11,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:11,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:11,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:11,349 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:11,349 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:11,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:11,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:11,360 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:11,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:11,363 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:11,364 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:11,364 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-04-26 16:59:11,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:59:11,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:59:11,380 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:11,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:11,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:11,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:11,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:11,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:11,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:11,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:11,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:11,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:11,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:11,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:11,443 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:11,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:11,619 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:11,734 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 65315 states, 65314 states have (on average 2.4212879321431853) internal successors, (in total 158144), 65314 states have internal predecessors, (158144), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:13,188 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 65315 states, 65314 states have (on average 2.4212879321431853) internal successors, (in total 158144), 65314 states have internal predecessors, (158144), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 133740 states and 325620 transitions. Complement of second has 6 states. [2025-04-26 16:59:13,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-04-26 16:59:13,198 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:59:13,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:13,198 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:59:13,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:13,198 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:59:13,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:13,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133740 states and 325620 transitions. [2025-04-26 16:59:14,478 INFO L131 ngComponentsAnalysis]: Automaton has 1953 accepting balls. 20853 [2025-04-26 16:59:15,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133740 states to 85494 states and 207207 transitions. [2025-04-26 16:59:15,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42705 [2025-04-26 16:59:15,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54931 [2025-04-26 16:59:15,371 INFO L74 IsDeterministic]: Start isDeterministic. Operand 85494 states and 207207 transitions. [2025-04-26 16:59:15,371 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:15,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85494 states and 207207 transitions. [2025-04-26 16:59:15,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85494 states and 207207 transitions. [2025-04-26 16:59:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85494 to 79381. [2025-04-26 16:59:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79381 states, 79381 states have (on average 2.5332762247893075) internal successors, (in total 201094), 79380 states have internal predecessors, (201094), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79381 states to 79381 states and 201094 transitions. [2025-04-26 16:59:17,656 INFO L240 hiAutomatonCegarLoop]: Abstraction has 79381 states and 201094 transitions. [2025-04-26 16:59:17,656 INFO L438 stractBuchiCegarLoop]: Abstraction has 79381 states and 201094 transitions. [2025-04-26 16:59:17,656 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:59:17,656 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79381 states and 201094 transitions. [2025-04-26 16:59:18,060 INFO L131 ngComponentsAnalysis]: Automaton has 1953 accepting balls. 20853 [2025-04-26 16:59:18,060 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:18,061 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:18,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:59:18,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:18,062 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L16: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[163] L16-->L33: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[119] L33-->L38: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[121] L38-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[123] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[166] L16-1-->L44: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" [2025-04-26 16:59:18,062 INFO L754 eck$LassoCheckResult]: Loop: "[126] L44-->L46: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[128] L46-->L47: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[130] L47-->L44: Formula: (= (+ v_c_4 1) v_c_3) InVars {c=v_c_4} OutVars{c=v_c_3} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:18,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash -791157317, now seen corresponding path program 1 times [2025-04-26 16:59:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477489092] [2025-04-26 16:59:18,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:18,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:18,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:18,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:18,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:18,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:18,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,070 INFO L85 PathProgramCache]: Analyzing trace with hash 154975, now seen corresponding path program 1 times [2025-04-26 16:59:18,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736820956] [2025-04-26 16:59:18,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:18,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:18,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:18,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1413014885, now seen corresponding path program 1 times [2025-04-26 16:59:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:18,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370721185] [2025-04-26 16:59:18,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:18,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:18,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:18,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:18,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:18,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:18,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:18,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:18,105 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:18,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:18,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:18,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:18,106 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:18,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:18,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:18,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:59:18,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:18,106 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:18,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,134 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:18,134 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:18,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,136 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:59:18,137 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:18,137 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:18,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:18,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,155 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:59:18,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:18,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:18,187 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:59:18,187 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=-3}, {c=-3}, {c=7}] Lambdas: [0, 1, 1] Nus: [1, 0] [2025-04-26 16:59:18,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:59:18,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,194 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:59:18,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:18,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:18,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,214 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:59:18,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:18,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:18,279 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:18,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:18,283 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:18,283 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:18,283 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:18,283 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:18,283 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:18,283 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,283 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:18,283 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:18,283 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:59:18,283 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:18,283 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:18,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:18,308 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:18,308 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:18,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,310 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:59:18,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:18,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:18,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:18,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:18,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:18,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:18,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:18,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:18,325 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:59:18,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:18,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,332 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:59:18,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:18,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:18,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:18,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:18,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:18,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:18,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:18,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:18,348 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:18,350 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:18,350 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:18,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:18,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:18,352 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:18,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:59:18,354 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:18,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:59:18,360 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:18,360 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:18,360 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:59:18,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:18,367 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:18,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:18,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:18,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:18,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:18,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:18,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:18,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:18,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:18,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:18,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:18,402 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:18,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:18,428 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:18,429 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 79381 states and 201094 transitions. cyclomatic complexity: 124869 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:19,925 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 79381 states and 201094 transitions. cyclomatic complexity: 124869. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 176101 states and 441038 transitions. Complement of second has 6 states. [2025-04-26 16:59:19,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2025-04-26 16:59:19,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 126 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:59:19,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:19,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 126 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:59:19,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:19,927 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 126 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:59:19,927 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:19,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176101 states and 441038 transitions. [2025-04-26 16:59:21,591 INFO L131 ngComponentsAnalysis]: Automaton has 1015 accepting balls. 7635 [2025-04-26 16:59:22,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176101 states to 117319 states and 294746 transitions. [2025-04-26 16:59:22,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44972 [2025-04-26 16:59:22,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52134 [2025-04-26 16:59:22,722 INFO L74 IsDeterministic]: Start isDeterministic. Operand 117319 states and 294746 transitions. [2025-04-26 16:59:22,722 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:22,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 117319 states and 294746 transitions. [2025-04-26 16:59:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117319 states and 294746 transitions. [2025-04-26 16:59:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117319 to 110571. [2025-04-26 16:59:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110571 states, 110571 states have (on average 2.5387940780132223) internal successors, (in total 280717), 110570 states have internal predecessors, (280717), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:25,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110571 states to 110571 states and 280717 transitions. [2025-04-26 16:59:25,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110571 states and 280717 transitions. [2025-04-26 16:59:25,162 INFO L438 stractBuchiCegarLoop]: Abstraction has 110571 states and 280717 transitions. [2025-04-26 16:59:25,162 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:59:25,162 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110571 states and 280717 transitions. [2025-04-26 16:59:25,821 INFO L131 ngComponentsAnalysis]: Automaton has 1015 accepting balls. 7635 [2025-04-26 16:59:25,821 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:25,821 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:25,822 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:25,822 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:25,822 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L16: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[163] L16-->L33: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[119] L33-->L38: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[121] L38-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[123] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[166] L16-1-->L44: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[125] L44-->L49: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[127] L49-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[129] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[169] L17-->L55: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" [2025-04-26 16:59:25,822 INFO L754 eck$LassoCheckResult]: Loop: "[132] L55-->L57: Formula: (< v_y1_1 v_z1_3) InVars {y1=v_y1_1, z1=v_z1_3} OutVars{y1=v_y1_1, z1=v_z1_3} AuxVars[] AssignedVars[]" "[134] L57-->L58: Formula: (= v_y1_2 (+ v_y1_3 1)) InVars {y1=v_y1_3} OutVars{y1=v_y1_2} AuxVars[] AssignedVars[y1]" "[136] L58-->L55: Formula: (= v_c_5 (+ v_c_6 1)) InVars {c=v_c_6} OutVars{c=v_c_5} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:25,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash 853757861, now seen corresponding path program 1 times [2025-04-26 16:59:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:25,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29973968] [2025-04-26 16:59:25,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:25,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:25,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:59:25,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:59:25,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:25,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:25,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:25,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:59:25,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:59:25,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:25,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:25,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 160933, now seen corresponding path program 1 times [2025-04-26 16:59:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:25,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980231324] [2025-04-26 16:59:25,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:25,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:25,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:25,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:25,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:25,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:25,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:25,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:25,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:25,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:25,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:25,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash -495758719, now seen corresponding path program 1 times [2025-04-26 16:59:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:25,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160978556] [2025-04-26 16:59:25,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:25,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:25,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:25,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:25,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:25,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:25,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:59:25,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:59:25,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:25,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:25,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:25,872 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:25,872 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:25,872 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:25,872 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:25,872 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:25,872 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:25,872 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:25,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:25,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:59:25,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:25,872 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:25,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:25,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:25,897 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:25,897 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:25,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:25,899 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:25,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:59:25,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:25,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:25,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:59:25,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:25,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:25,920 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:25,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:59:25,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:25,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:25,985 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:25,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:25,989 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:25,989 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:25,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:25,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:25,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:25,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:25,990 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:25,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:25,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:59:25,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:25,990 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:25,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:25,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:26,017 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:26,017 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:26,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:26,019 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:26,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:59:26,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:26,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:26,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:26,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:26,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:26,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:26,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:26,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:26,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:26,041 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:26,041 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:59:26,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:26,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:26,043 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:26,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:59:26,046 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:26,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:26,049 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:26,050 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:26,050 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, z1) = -1*y1 + 1*z1 Supporting invariants [] [2025-04-26 16:59:26,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:26,056 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:26,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:26,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:59:26,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:59:26,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:26,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:26,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:26,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:26,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:26,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:26,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:26,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:26,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:26,127 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:26,127 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 110571 states and 280717 transitions. cyclomatic complexity: 173660 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:28,050 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 110571 states and 280717 transitions. cyclomatic complexity: 173660. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 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 258901 states and 650563 transitions. Complement of second has 6 states. [2025-04-26 16:59:28,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-26 16:59:28,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:59:28,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:28,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:59:28,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:28,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:59:28,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:28,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258901 states and 650563 transitions. [2025-04-26 16:59:30,645 INFO L131 ngComponentsAnalysis]: Automaton has 483 accepting balls. 2583 [2025-04-26 16:59:32,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258901 states to 165519 states and 412002 transitions. [2025-04-26 16:59:32,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47998 [2025-04-26 16:59:32,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51647 [2025-04-26 16:59:32,188 INFO L74 IsDeterministic]: Start isDeterministic. Operand 165519 states and 412002 transitions. [2025-04-26 16:59:32,188 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:32,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 165519 states and 412002 transitions. [2025-04-26 16:59:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165519 states and 412002 transitions. [2025-04-26 16:59:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165519 to 160773. [2025-04-26 16:59:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160773 states, 160773 states have (on average 2.5137491991814547) internal successors, (in total 404143), 160772 states have internal predecessors, (404143), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160773 states to 160773 states and 404143 transitions. [2025-04-26 16:59:35,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 160773 states and 404143 transitions. [2025-04-26 16:59:35,523 INFO L438 stractBuchiCegarLoop]: Abstraction has 160773 states and 404143 transitions. [2025-04-26 16:59:35,523 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:59:35,523 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160773 states and 404143 transitions. [2025-04-26 16:59:36,358 INFO L131 ngComponentsAnalysis]: Automaton has 483 accepting balls. 2583 [2025-04-26 16:59:36,358 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:36,358 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:36,362 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:36,362 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:36,363 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L16: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[163] L16-->L33: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[119] L33-->L38: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[121] L38-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[123] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[166] L16-1-->L44: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[125] L44-->L49: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[127] L49-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[129] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[169] L17-->L55: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[131] L55-->L60: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[133] L60-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[135] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[172] L18-->L66: Formula: (and (= v_thread4Thread1of1ForFork5_thidvar2_2 4) (= v_thread4Thread1of1ForFork5_thidvar0_2 4) (= v_thread4Thread1of1ForFork5_thidvar1_2 4) (= v_thread4Thread1of1ForFork5_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork5_thidvar3=v_thread4Thread1of1ForFork5_thidvar3_2, thread4Thread1of1ForFork5_thidvar2=v_thread4Thread1of1ForFork5_thidvar2_2, thread4Thread1of1ForFork5_thidvar1=v_thread4Thread1of1ForFork5_thidvar1_2, thread4Thread1of1ForFork5_thidvar0=v_thread4Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_thidvar3, thread4Thread1of1ForFork5_thidvar2, thread4Thread1of1ForFork5_thidvar1, thread4Thread1of1ForFork5_thidvar0]" [2025-04-26 16:59:36,363 INFO L754 eck$LassoCheckResult]: Loop: "[138] L66-->L68: Formula: (< v_x3_1 v_z1_5) InVars {x3=v_x3_1, z1=v_z1_5} OutVars{x3=v_x3_1, z1=v_z1_5} AuxVars[] AssignedVars[]" "[140] L68-->L69: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[142] L69-->L66: Formula: (= v_c_7 (+ v_c_8 1)) InVars {c=v_c_8} OutVars{c=v_c_7} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:36,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1811318284, now seen corresponding path program 1 times [2025-04-26 16:59:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:36,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617133495] [2025-04-26 16:59:36,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:36,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:36,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:59:36,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:59:36,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:36,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:59:36,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:59:36,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:36,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash 166891, now seen corresponding path program 1 times [2025-04-26 16:59:36,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:36,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253384924] [2025-04-26 16:59:36,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:36,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:36,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:36,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:36,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,375 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:36,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:36,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:36,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:36,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash -985971200, now seen corresponding path program 1 times [2025-04-26 16:59:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:36,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845052304] [2025-04-26 16:59:36,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:36,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:59:36,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:59:36,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,383 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:36,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:59:36,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:59:36,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:36,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:36,419 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:36,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:36,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:36,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:36,419 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:36,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:36,419 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:36,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:59:36,419 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:36,419 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:36,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,445 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:36,445 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,447 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:36,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:59:36,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:36,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:36,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:36,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,467 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:36,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:59:36,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:36,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:36,532 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:36,535 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 16:59:36,535 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:36,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:36,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:36,536 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:36,536 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:36,536 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,536 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:36,536 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:36,536 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:59:36,536 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:36,536 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:36,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:36,565 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:36,565 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,568 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:36,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:59:36,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:36,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:36,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:36,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:36,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:36,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:36,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:36,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:36,583 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:36,588 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:36,588 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:59:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:36,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:36,589 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:36,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:59:36,592 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:36,594 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:59:36,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:36,595 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:36,595 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:36,595 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x3) = 1*z1 - 1*x3 Supporting invariants [] [2025-04-26 16:59:36,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:59:36,602 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:36,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:36,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:59:36,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:59:36,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:36,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:36,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:36,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:36,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:36,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:36,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:36,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:36,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:36,681 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:36,681 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 160773 states and 404143 transitions. cyclomatic complexity: 247940 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:39,453 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 160773 states and 404143 transitions. cyclomatic complexity: 247940. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 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 377625 states and 936297 transitions. Complement of second has 6 states. [2025-04-26 16:59:39,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (in total 17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-04-26 16:59:39,454 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:59:39,454 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:39,454 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 17 letters. Loop has 3 letters. [2025-04-26 16:59:39,455 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:39,455 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 136 transitions. Stem has 14 letters. Loop has 6 letters. [2025-04-26 16:59:39,455 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:39,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377625 states and 936297 transitions. [2025-04-26 16:59:42,906 INFO L131 ngComponentsAnalysis]: Automaton has 203 accepting balls. 795 [2025-04-26 16:59:44,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377625 states to 229668 states and 563772 transitions. [2025-04-26 16:59:44,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53164 [2025-04-26 16:59:44,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55118 [2025-04-26 16:59:44,619 INFO L74 IsDeterministic]: Start isDeterministic. Operand 229668 states and 563772 transitions. [2025-04-26 16:59:44,619 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:44,619 INFO L218 hiAutomatonCegarLoop]: Abstraction has 229668 states and 563772 transitions. [2025-04-26 16:59:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229668 states and 563772 transitions. [2025-04-26 16:59:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229668 to 225469. [2025-04-26 16:59:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225469 states, 225469 states have (on average 2.476021093808905) internal successors, (in total 558266), 225468 states have internal predecessors, (558266), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225469 states to 225469 states and 558266 transitions. [2025-04-26 16:59:49,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 225469 states and 558266 transitions. [2025-04-26 16:59:49,282 INFO L438 stractBuchiCegarLoop]: Abstraction has 225469 states and 558266 transitions. [2025-04-26 16:59:49,282 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:59:49,282 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225469 states and 558266 transitions. [2025-04-26 16:59:50,339 INFO L131 ngComponentsAnalysis]: Automaton has 203 accepting balls. 795 [2025-04-26 16:59:50,339 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:50,339 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:50,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:50,340 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:59:50,340 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L16: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[163] L16-->L33: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[119] L33-->L38: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[121] L38-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[123] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[166] L16-1-->L44: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[125] L44-->L49: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[127] L49-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[129] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[169] L17-->L55: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[131] L55-->L60: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[133] L60-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[135] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[172] L18-->L66: Formula: (and (= v_thread4Thread1of1ForFork5_thidvar2_2 4) (= v_thread4Thread1of1ForFork5_thidvar0_2 4) (= v_thread4Thread1of1ForFork5_thidvar1_2 4) (= v_thread4Thread1of1ForFork5_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork5_thidvar3=v_thread4Thread1of1ForFork5_thidvar3_2, thread4Thread1of1ForFork5_thidvar2=v_thread4Thread1of1ForFork5_thidvar2_2, thread4Thread1of1ForFork5_thidvar1=v_thread4Thread1of1ForFork5_thidvar1_2, thread4Thread1of1ForFork5_thidvar0=v_thread4Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_thidvar3, thread4Thread1of1ForFork5_thidvar2, thread4Thread1of1ForFork5_thidvar1, thread4Thread1of1ForFork5_thidvar0]" "[137] L66-->L71: Formula: (<= v_z1_6 v_x3_4) InVars {x3=v_x3_4, z1=v_z1_6} OutVars{x3=v_x3_4, z1=v_z1_6} AuxVars[] AssignedVars[]" "[139] L71-->thread4FINAL: Formula: (= (+ v_f_9 1) v_f_8) InVars {f=v_f_9} OutVars{f=v_f_8} AuxVars[] AssignedVars[f]" "[141] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[157] L19-->L77: Formula: (and (= 5 v_thread5Thread1of1ForFork0_thidvar4_2) (= 5 v_thread5Thread1of1ForFork0_thidvar3_2) (= 5 v_thread5Thread1of1ForFork0_thidvar2_2) (= 5 v_thread5Thread1of1ForFork0_thidvar1_2) (= 5 v_thread5Thread1of1ForFork0_thidvar0_2)) InVars {} OutVars{thread5Thread1of1ForFork0_thidvar4=v_thread5Thread1of1ForFork0_thidvar4_2, thread5Thread1of1ForFork0_thidvar3=v_thread5Thread1of1ForFork0_thidvar3_2, thread5Thread1of1ForFork0_thidvar2=v_thread5Thread1of1ForFork0_thidvar2_2, thread5Thread1of1ForFork0_thidvar1=v_thread5Thread1of1ForFork0_thidvar1_2, thread5Thread1of1ForFork0_thidvar0=v_thread5Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_thidvar4, thread5Thread1of1ForFork0_thidvar3, thread5Thread1of1ForFork0_thidvar2, thread5Thread1of1ForFork0_thidvar1, thread5Thread1of1ForFork0_thidvar0]" [2025-04-26 16:59:50,341 INFO L754 eck$LassoCheckResult]: Loop: "[144] L77-->L79: Formula: (< v_x4_1 v_z1_7) InVars {x4=v_x4_1, z1=v_z1_7} OutVars{x4=v_x4_1, z1=v_z1_7} AuxVars[] AssignedVars[]" "[146] L79-->L80: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[148] L80-->L77: Formula: (= (+ v_c_10 1) v_c_9) InVars {c=v_c_10} OutVars{c=v_c_9} AuxVars[] AssignedVars[c]" [2025-04-26 16:59:50,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:50,341 INFO L85 PathProgramCache]: Analyzing trace with hash -500366754, now seen corresponding path program 1 times [2025-04-26 16:59:50,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:50,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82490248] [2025-04-26 16:59:50,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:50,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:50,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:50,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:50,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:50,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:50,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:50,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:50,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:50,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 172849, now seen corresponding path program 1 times [2025-04-26 16:59:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:50,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167140827] [2025-04-26 16:59:50,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:50,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:50,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:50,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:50,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:50,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:50,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:50,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:50,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:50,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1405659060, now seen corresponding path program 1 times [2025-04-26 16:59:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:50,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175097559] [2025-04-26 16:59:50,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:50,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:50,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:50,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:50,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:59:50,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:59:50,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:50,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:50,388 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:50,388 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:50,388 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:50,389 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:50,389 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:50,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:50,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:50,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:50,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:50,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:50,389 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:50,389 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:50,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:50,411 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:50,411 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:50,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:50,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:50,413 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:50,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:59:50,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:50,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:50,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:59:50,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:50,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:50,434 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:50,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:59:50,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:50,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:50,495 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:50,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:50,499 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:50,499 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:50,499 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:50,499 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:50,499 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:50,499 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:50,499 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:50,499 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:50,499 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:59:50,499 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:50,499 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:50,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:50,504 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:50,519 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:50,519 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:50,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:50,521 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:50,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:59:50,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:50,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:50,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:50,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:50,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:50,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:50,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:50,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:50,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:50,535 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:50,535 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:50,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:50,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:50,537 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:59:50,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:59:50,538 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:50,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:50,541 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:50,541 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:50,541 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x4) = 1*z1 - 1*x4 Supporting invariants [] [2025-04-26 16:59:50,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:59:50,547 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:50,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:50,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:59:50,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:59:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:50,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:50,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:50,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:59:50,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:59:50,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:50,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:50,587 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:50,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:50,735 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:59:50,735 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 225469 states and 558266 transitions. cyclomatic complexity: 339043 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:54,103 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 225469 states and 558266 transitions. cyclomatic complexity: 339043. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 521350 states and 1270609 transitions. Complement of second has 6 states. [2025-04-26 16:59:54,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:59:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (in total 21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:54,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-04-26 16:59:54,105 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 18 letters. Loop has 3 letters. [2025-04-26 16:59:54,105 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:54,105 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 21 letters. Loop has 3 letters. [2025-04-26 16:59:54,105 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:54,105 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 141 transitions. Stem has 18 letters. Loop has 6 letters. [2025-04-26 16:59:54,105 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:54,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 521350 states and 1270609 transitions. [2025-04-26 16:59:58,962 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 189 [2025-04-26 17:00:01,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 521350 states to 286701 states and 692387 transitions. [2025-04-26 17:00:01,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55829 [2025-04-26 17:00:01,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56994 [2025-04-26 17:00:01,191 INFO L74 IsDeterministic]: Start isDeterministic. Operand 286701 states and 692387 transitions. [2025-04-26 17:00:01,191 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 17:00:01,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286701 states and 692387 transitions. [2025-04-26 17:00:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286701 states and 692387 transitions. [2025-04-26 17:00:05,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286701 to 282441. [2025-04-26 17:00:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282441 states, 282441 states have (on average 2.434083578517283) internal successors, (in total 687485), 282440 states have internal predecessors, (687485), 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 17:00:06,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282441 states to 282441 states and 687485 transitions. [2025-04-26 17:00:06,791 INFO L240 hiAutomatonCegarLoop]: Abstraction has 282441 states and 687485 transitions. [2025-04-26 17:00:06,791 INFO L438 stractBuchiCegarLoop]: Abstraction has 282441 states and 687485 transitions. [2025-04-26 17:00:06,791 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 17:00:06,793 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282441 states and 687485 transitions. [2025-04-26 17:00:08,352 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 189 [2025-04-26 17:00:08,352 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 17:00:08,352 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 17:00:08,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 17:00:08,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 17:00:08,354 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L16: Formula: (= v_f_7 0) InVars {f=v_f_7} OutVars{f=v_f_7} AuxVars[] AssignedVars[]" "[163] L16-->L33: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[119] L33-->L38: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[121] L38-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[123] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[166] L16-1-->L44: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar0_2 2) (= v_thread2Thread1of1ForFork3_thidvar1_2 2)) InVars {} OutVars{thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1]" "[125] L44-->L49: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[127] L49-->thread2FINAL: Formula: (= (+ v_f_4 1) v_f_3) InVars {f=v_f_4} OutVars{f=v_f_3} AuxVars[] AssignedVars[f]" "[129] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[169] L17-->L55: Formula: (and (= v_thread3Thread1of1ForFork4_thidvar0_2 3) (= v_thread3Thread1of1ForFork4_thidvar1_2 3) (= v_thread3Thread1of1ForFork4_thidvar2_2 3)) InVars {} OutVars{thread3Thread1of1ForFork4_thidvar0=v_thread3Thread1of1ForFork4_thidvar0_2, thread3Thread1of1ForFork4_thidvar1=v_thread3Thread1of1ForFork4_thidvar1_2, thread3Thread1of1ForFork4_thidvar2=v_thread3Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork4_thidvar0, thread3Thread1of1ForFork4_thidvar1, thread3Thread1of1ForFork4_thidvar2]" "[131] L55-->L60: Formula: (<= v_z1_4 v_y1_4) InVars {y1=v_y1_4, z1=v_z1_4} OutVars{y1=v_y1_4, z1=v_z1_4} AuxVars[] AssignedVars[]" "[133] L60-->thread3FINAL: Formula: (= v_f_5 (+ v_f_6 1)) InVars {f=v_f_6} OutVars{f=v_f_5} AuxVars[] AssignedVars[f]" "[135] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[172] L18-->L66: Formula: (and (= v_thread4Thread1of1ForFork5_thidvar2_2 4) (= v_thread4Thread1of1ForFork5_thidvar0_2 4) (= v_thread4Thread1of1ForFork5_thidvar1_2 4) (= v_thread4Thread1of1ForFork5_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork5_thidvar3=v_thread4Thread1of1ForFork5_thidvar3_2, thread4Thread1of1ForFork5_thidvar2=v_thread4Thread1of1ForFork5_thidvar2_2, thread4Thread1of1ForFork5_thidvar1=v_thread4Thread1of1ForFork5_thidvar1_2, thread4Thread1of1ForFork5_thidvar0=v_thread4Thread1of1ForFork5_thidvar0_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork5_thidvar3, thread4Thread1of1ForFork5_thidvar2, thread4Thread1of1ForFork5_thidvar1, thread4Thread1of1ForFork5_thidvar0]" "[137] L66-->L71: Formula: (<= v_z1_6 v_x3_4) InVars {x3=v_x3_4, z1=v_z1_6} OutVars{x3=v_x3_4, z1=v_z1_6} AuxVars[] AssignedVars[]" "[139] L71-->thread4FINAL: Formula: (= (+ v_f_9 1) v_f_8) InVars {f=v_f_9} OutVars{f=v_f_8} AuxVars[] AssignedVars[f]" "[141] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[157] L19-->L77: Formula: (and (= 5 v_thread5Thread1of1ForFork0_thidvar4_2) (= 5 v_thread5Thread1of1ForFork0_thidvar3_2) (= 5 v_thread5Thread1of1ForFork0_thidvar2_2) (= 5 v_thread5Thread1of1ForFork0_thidvar1_2) (= 5 v_thread5Thread1of1ForFork0_thidvar0_2)) InVars {} OutVars{thread5Thread1of1ForFork0_thidvar4=v_thread5Thread1of1ForFork0_thidvar4_2, thread5Thread1of1ForFork0_thidvar3=v_thread5Thread1of1ForFork0_thidvar3_2, thread5Thread1of1ForFork0_thidvar2=v_thread5Thread1of1ForFork0_thidvar2_2, thread5Thread1of1ForFork0_thidvar1=v_thread5Thread1of1ForFork0_thidvar1_2, thread5Thread1of1ForFork0_thidvar0=v_thread5Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork0_thidvar4, thread5Thread1of1ForFork0_thidvar3, thread5Thread1of1ForFork0_thidvar2, thread5Thread1of1ForFork0_thidvar1, thread5Thread1of1ForFork0_thidvar0]" "[143] L77-->L82: Formula: (<= v_z1_8 v_x4_4) InVars {x4=v_x4_4, z1=v_z1_8} OutVars{x4=v_x4_4, z1=v_z1_8} AuxVars[] AssignedVars[]" "[145] L82-->thread5FINAL: Formula: (= v_f_10 (+ v_f_11 1)) InVars {f=v_f_11} OutVars{f=v_f_10} AuxVars[] AssignedVars[f]" "[147] thread5FINAL-->thread5EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[160] L20-->$Ultimate##0: Formula: (and (= 6 v_thread6Thread1of1ForFork1_thidvar1_2) (= 6 v_thread6Thread1of1ForFork1_thidvar3_2) (= 6 v_thread6Thread1of1ForFork1_thidvar0_2) (= 6 v_thread6Thread1of1ForFork1_thidvar2_2) (= 6 v_thread6Thread1of1ForFork1_thidvar5_2) (= 6 v_thread6Thread1of1ForFork1_thidvar4_2)) InVars {} OutVars{thread6Thread1of1ForFork1_thidvar2=v_thread6Thread1of1ForFork1_thidvar2_2, thread6Thread1of1ForFork1_thidvar3=v_thread6Thread1of1ForFork1_thidvar3_2, thread6Thread1of1ForFork1_thidvar0=v_thread6Thread1of1ForFork1_thidvar0_2, thread6Thread1of1ForFork1_thidvar1=v_thread6Thread1of1ForFork1_thidvar1_2, thread6Thread1of1ForFork1_thidvar4=v_thread6Thread1of1ForFork1_thidvar4_2, thread6Thread1of1ForFork1_thidvar5=v_thread6Thread1of1ForFork1_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork1_thidvar2, thread6Thread1of1ForFork1_thidvar3, thread6Thread1of1ForFork1_thidvar0, thread6Thread1of1ForFork1_thidvar1, thread6Thread1of1ForFork1_thidvar4, thread6Thread1of1ForFork1_thidvar5]" "[149] $Ultimate##0-->L89-1: Formula: (< 4 v_f_12) InVars {f=v_f_12} OutVars{f=v_f_12} AuxVars[] AssignedVars[]" [2025-04-26 17:00:08,354 INFO L754 eck$LassoCheckResult]: Loop: "[151] L89-1-->L91: Formula: (< v_y2_4 v_z2_4) InVars {z2=v_z2_4, y2=v_y2_4} OutVars{z2=v_z2_4, y2=v_y2_4} AuxVars[] AssignedVars[]" "[153] L91-->L92: Formula: (= (+ v_y2_2 1) v_y2_1) InVars {y2=v_y2_2} OutVars{y2=v_y2_1} AuxVars[] AssignedVars[y2]" "[154] L92-->L89-1: Formula: (= (+ v_c_11 1) v_c_12) InVars {c=v_c_12} OutVars{c=v_c_11} AuxVars[] AssignedVars[c]" [2025-04-26 17:00:08,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2077290744, now seen corresponding path program 1 times [2025-04-26 17:00:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 17:00:08,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357905032] [2025-04-26 17:00:08,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 17:00:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 17:00:08,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 17:00:08,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 17:00:08,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:08,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 17:00:08,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 17:00:08,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 17:00:08,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:08,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 17:00:08,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 179799, now seen corresponding path program 1 times [2025-04-26 17:00:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 17:00:08,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872034728] [2025-04-26 17:00:08,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 17:00:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 17:00:08,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 17:00:08,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 17:00:08,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:08,369 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 17:00:08,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 17:00:08,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 17:00:08,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:08,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 17:00:08,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1615363568, now seen corresponding path program 1 times [2025-04-26 17:00:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 17:00:08,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905243390] [2025-04-26 17:00:08,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 17:00:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 17:00:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 17:00:08,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 17:00:08,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:08,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 17:00:08,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 17:00:08,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 17:00:08,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 17:00:08,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 17:00:08,418 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 17:00:08,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 17:00:08,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 17:00:08,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 17:00:08,419 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 17:00:08,419 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,419 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 17:00:08,419 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 17:00:08,419 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration6_Loop [2025-04-26 17:00:08,419 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 17:00:08,419 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 17:00:08,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:08,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:08,447 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 17:00:08,447 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 17:00:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:08,451 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 17:00:08,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 17:00:08,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 17:00:08,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:08,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 17:00:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:08,470 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 17:00:08,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 17:00:08,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 17:00:08,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:08,491 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 17:00:08,492 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {c=0} Honda state: {c=0} Generalized eigenvectors: [{c=0}, {c=7}, {c=-8}] Lambdas: [0, 1, 1] Nus: [0, 0] [2025-04-26 17:00:08,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 17:00:08,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:08,498 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 17:00:08,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 17:00:08,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 17:00:08,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:08,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 17:00:08,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:08,515 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 17:00:08,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 17:00:08,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 17:00:08,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 17:00:08,572 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 17:00:08,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 17:00:08,576 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 17:00:08,576 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 17:00:08,576 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 17:00:08,576 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 17:00:08,576 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 17:00:08,576 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,576 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 17:00:08,576 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 17:00:08,576 INFO L132 ssoRankerPreferences]: Filename of dumped script: pc6v.c.bpl_petrified1_Iteration6_Loop [2025-04-26 17:00:08,576 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 17:00:08,576 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 17:00:08,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:08,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 17:00:08,597 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 17:00:08,597 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 17:00:08,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:08,599 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 17:00:08,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 17:00:08,601 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 17:00:08,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 17:00:08,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 17:00:08,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 17:00:08,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 17:00:08,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 17:00:08,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 17:00:08,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 17:00:08,613 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 17:00:08,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 17:00:08,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:08,620 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 17:00:08,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 17:00:08,622 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 17:00:08,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 17:00:08,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 17:00:08,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 17:00:08,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 17:00:08,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 17:00:08,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 17:00:08,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 17:00:08,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 17:00:08,637 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 17:00:08,637 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 17:00:08,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 17:00:08,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 17:00:08,639 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 17:00:08,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 17:00:08,641 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 17:00:08,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 17:00:08,644 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 17:00:08,644 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 17:00:08,644 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, z2) = -1*y2 + 1*z2 Supporting invariants [] [2025-04-26 17:00:08,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 17:00:08,650 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 17:00:08,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 17:00:08,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 17:00:08,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 17:00:08,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 17:00:08,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 17:00:08,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 17:00:08,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 17:00:08,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 17:00:08,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 17:00:08,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 17:00:08,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 17:00:08,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 17:00:08,728 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 17:00:08,729 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 17:00:08,729 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 282441 states and 687485 transitions. cyclomatic complexity: 413206 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 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 17:00:12,068 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 282441 states and 687485 transitions. cyclomatic complexity: 413206. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 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 535217 states and 1267027 transitions. Complement of second has 6 states. [2025-04-26 17:00:12,069 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 17:00:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 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 17:00:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-04-26 17:00:12,070 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 145 transitions. Stem has 23 letters. Loop has 3 letters. [2025-04-26 17:00:12,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 17:00:12,070 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 145 transitions. Stem has 26 letters. Loop has 3 letters. [2025-04-26 17:00:12,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 17:00:12,070 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 145 transitions. Stem has 23 letters. Loop has 6 letters. [2025-04-26 17:00:12,070 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 17:00:12,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 535217 states and 1267027 transitions.