/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/indep_loops_minus1_8.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:23,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:23,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:23,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:23,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:23,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:23,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:23,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:23,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:23,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:23,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:23,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:23,294 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:23,294 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:23,297 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:23,297 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:23,297 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:23,297 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:23,297 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:23,297 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:23,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:23,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:23,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:23,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:23,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:23,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:23,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:23,299 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:23,299 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:23,299 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:23,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:23,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:23,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:23,603 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:23,603 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:23,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_8.c.bpl [2025-04-26 16:58:23,604 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_8.c.bpl' [2025-04-26 16:58:23,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:23,618 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:23,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:23,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:23,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:23,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,640 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,648 INFO L138 Inliner]: procedures = 9, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:23,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:23,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:23,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:23,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:23,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,661 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,664 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:23,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:23,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:23,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:23,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/1) ... [2025-04-26 16:58:23,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:23,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:23,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:23,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:58:23,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:23,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:23,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:23,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:23,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:23,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:23,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:23,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:23,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:58:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:58:23,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread7 given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread7 [2025-04-26 16:58:23,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread7 [2025-04-26 16:58:23,722 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread8 given in one single declaration [2025-04-26 16:58:23,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread8 [2025-04-26 16:58:23,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread8 [2025-04-26 16:58:23,723 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:58:23,761 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:23,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:23,870 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:23,871 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:23,878 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:23,878 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:23,879 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:23 BoogieIcfgContainer [2025-04-26 16:58:23,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:23,880 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:23,880 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:23,883 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:23,884 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:23,884 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:23" (1/2) ... [2025-04-26 16:58:23,885 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7de89df0 and model type indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:23, skipping insertion in model container [2025-04-26 16:58:23,885 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:23,885 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_8.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:23" (2/2) ... [2025-04-26 16:58:23,886 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_8.c.bpl [2025-04-26 16:58:23,958 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-26 16:58:23,991 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:23,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:23,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:23,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:58:24,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 66 transitions, 188 flow [2025-04-26 16:58:24,078 INFO L116 PetriNetUnfolderBase]: 8/50 cut-off events. [2025-04-26 16:58:24,079 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-26 16:58:24,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 50 events. 8/50 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2025-04-26 16:58:24,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 66 transitions, 188 flow [2025-04-26 16:58:24,088 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 50 transitions, 148 flow [2025-04-26 16:58:24,089 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 67 places, 50 transitions, 148 flow [2025-04-26 16:58:24,094 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:38,834 WARN L140 AmpleReduction]: Number of pruned transitions: 440100 [2025-04-26 16:58:38,835 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:38,835 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 53286 [2025-04-26 16:58:38,835 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:43 [2025-04-26 16:58:38,835 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:68110 [2025-04-26 16:58:38,835 WARN L145 AmpleReduction]: Times succ was already a loop node:173965 [2025-04-26 16:58:38,835 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:39745 [2025-04-26 16:58:38,835 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:39,376 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 121440 states, 121439 states have (on average 4.251294888791904) internal successors, (in total 516273), 121439 states have internal predecessors, (516273), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:39,383 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:39,384 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:39,384 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:39,384 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:39,384 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:39,384 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:39,384 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:39,384 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:39,596 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121440 states, 121439 states have (on average 4.251294888791904) internal successors, (in total 516273), 121439 states have internal predecessors, (516273), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:42,402 INFO L131 ngComponentsAnalysis]: Automaton has 12198 accepting balls. 120214 [2025-04-26 16:58:42,403 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:42,403 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:42,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:42,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:42,412 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:42,684 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 121440 states, 121439 states have (on average 4.251294888791904) internal successors, (in total 516273), 121439 states have internal predecessors, (516273), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:44,817 INFO L131 ngComponentsAnalysis]: Automaton has 12198 accepting balls. 120214 [2025-04-26 16:58:44,818 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:44,818 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:44,823 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:44,823 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:44,827 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->L35: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:44,827 INFO L754 eck$LassoCheckResult]: Loop: "[125] L35-->L37: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[127] L37-->L35: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:58:44,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:44,831 INFO L85 PathProgramCache]: Analyzing trace with hash 190, now seen corresponding path program 1 times [2025-04-26 16:58:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:44,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991988220] [2025-04-26 16:58:44,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:44,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:44,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:44,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:44,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:44,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:44,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:44,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:44,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:44,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 4963, now seen corresponding path program 1 times [2025-04-26 16:58:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:44,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110243120] [2025-04-26 16:58:44,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:44,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:44,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:44,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:44,914 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:44,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:44,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:44,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash 186592, now seen corresponding path program 1 times [2025-04-26 16:58:44,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:44,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377884321] [2025-04-26 16:58:44,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:44,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:44,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:44,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:44,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:44,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:44,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:44,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:44,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:44,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:44,975 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:44,976 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:44,976 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:44,976 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:44,976 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:44,976 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:44,976 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:44,976 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:44,976 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_8.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:44,976 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:44,977 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:45,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:45,121 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:45,122 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:45,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,130 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:45,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:58:45,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:45,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:58:45,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:45,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:58:45,184 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:45,184 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:45,332 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:45,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:58:45,337 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:45,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:45,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:45,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:45,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:45,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:45,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:45,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_8.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:45,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:45,338 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:45,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:45,367 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:45,370 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:45,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,374 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:45,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:58:45,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:45,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:45,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:45,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:45,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:45,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:45,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:45,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:45,407 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:45,413 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:45,413 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:45,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:45,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:45,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:58:45,423 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:45,426 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:45,427 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:58:45,427 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:45,431 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:45,432 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:58:45,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:45,445 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:45,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:45,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:45,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:45,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:45,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:45,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:45,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:45,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:45,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:45,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:45,506 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:45,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:45,560 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:45,834 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 121440 states, 121439 states have (on average 4.251294888791904) internal successors, (in total 516273), 121439 states have internal predecessors, (516273), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:51,092 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 121440 states, 121439 states have (on average 4.251294888791904) internal successors, (in total 516273), 121439 states have internal predecessors, (516273), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 315235 states and 1415526 transitions. Complement of second has 6 states. [2025-04-26 16:58:51,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2025-04-26 16:58:51,102 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:58:51,103 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:51,103 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:58:51,103 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:51,103 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 122 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:58:51,104 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:51,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315235 states and 1415526 transitions. [2025-04-26 16:58:56,905 INFO L131 ngComponentsAnalysis]: Automaton has 14038 accepting balls. 81644 [2025-04-26 16:59:00,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315235 states to 206038 states and 895446 transitions. [2025-04-26 16:59:00,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95619 [2025-04-26 16:59:00,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140482 [2025-04-26 16:59:00,869 INFO L74 IsDeterministic]: Start isDeterministic. Operand 206038 states and 895446 transitions. [2025-04-26 16:59:00,870 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:00,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 206038 states and 895446 transitions. [2025-04-26 16:59:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206038 states and 895446 transitions. [2025-04-26 16:59:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206038 to 163893. [2025-04-26 16:59:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163893 states, 163893 states have (on average 4.46244195908306) internal successors, (in total 731363), 163892 states have internal predecessors, (731363), 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:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163893 states to 163893 states and 731363 transitions. [2025-04-26 16:59:07,825 INFO L240 hiAutomatonCegarLoop]: Abstraction has 163893 states and 731363 transitions. [2025-04-26 16:59:07,825 INFO L438 stractBuchiCegarLoop]: Abstraction has 163893 states and 731363 transitions. [2025-04-26 16:59:07,825 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:59:07,825 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 163893 states and 731363 transitions. [2025-04-26 16:59:09,335 INFO L131 ngComponentsAnalysis]: Automaton has 14038 accepting balls. 81644 [2025-04-26 16:59:09,335 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:09,335 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:09,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:59:09,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:59:09,343 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->L35: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L35-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[126] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[162] L14-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:59:09,343 INFO L754 eck$LassoCheckResult]: Loop: "[129] L44-->L46: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[131] L46-->L44: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:59:09,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash 5783522, now seen corresponding path program 1 times [2025-04-26 16:59:09,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:09,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034198751] [2025-04-26 16:59:09,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:09,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:59:09,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:59:09,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,350 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:09,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:59:09,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:59:09,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:09,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash 5091, now seen corresponding path program 1 times [2025-04-26 16:59:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:09,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423070343] [2025-04-26 16:59:09,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:09,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:09,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:09,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:09,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:09,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:09,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:09,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1263001476, now seen corresponding path program 1 times [2025-04-26 16:59:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:09,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496159312] [2025-04-26 16:59:09,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:09,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:09,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:09,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:09,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:59:09,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:59:09,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:09,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:09,397 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:09,397 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:09,398 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:09,398 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:09,398 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:09,398 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,398 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:09,398 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:09,398 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_8.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:59:09,398 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:09,398 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:09,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,429 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:09,429 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:09,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,432 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:09,433 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:09,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:09,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:09,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:59:09,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,490 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:09,494 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:09,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:09,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:09,581 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:09,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:59:09,586 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:09,586 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:09,586 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:09,586 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:09,586 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:09,586 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,586 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:09,586 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:09,586 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_8.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:59:09,586 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:09,586 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:09,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:09,615 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:09,615 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:09,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,617 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:09,622 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:09,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:59:09,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:09,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:09,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:09,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:09,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:09,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:09,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:09,655 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:09,658 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:59:09,658 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:59:09,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:09,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:09,664 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:09,666 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:09,669 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:59:09,669 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:09,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:59:09,670 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:09,670 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:09,670 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:59:09,675 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:09,676 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:09,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:09,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:59:09,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:59:09,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:09,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:09,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:09,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:09,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:09,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:59:09,748 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:59:09,749 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 163893 states and 731363 transitions. cyclomatic complexity: 584660 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:15,792 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 163893 states and 731363 transitions. cyclomatic complexity: 584660. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 440040 states and 1963507 transitions. Complement of second has 6 states. [2025-04-26 16:59:15,794 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:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2025-04-26 16:59:15,794 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 124 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:59:15,795 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:15,795 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 124 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:59:15,795 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:15,795 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 124 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:59:15,795 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:15,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 440040 states and 1963507 transitions. [2025-04-26 16:59:22,784 INFO L131 ngComponentsAnalysis]: Automaton has 14963 accepting balls. 55960 [2025-04-26 16:59:26,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 440040 states to 293709 states and 1284077 transitions. [2025-04-26 16:59:26,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106189 [2025-04-26 16:59:27,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140343 [2025-04-26 16:59:27,025 INFO L74 IsDeterministic]: Start isDeterministic. Operand 293709 states and 1284077 transitions. [2025-04-26 16:59:27,025 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:59:27,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 293709 states and 1284077 transitions. [2025-04-26 16:59:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293709 states and 1284077 transitions. [2025-04-26 16:59:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293709 to 259128. [2025-04-26 16:59:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259128 states, 259128 states have (on average 4.4382197215275845) internal successors, (in total 1150067), 259127 states have internal predecessors, (1150067), 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,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259128 states to 259128 states and 1150067 transitions. [2025-04-26 16:59:35,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 259128 states and 1150067 transitions. [2025-04-26 16:59:35,431 INFO L438 stractBuchiCegarLoop]: Abstraction has 259128 states and 1150067 transitions. [2025-04-26 16:59:35,431 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:59:35,431 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 259128 states and 1150067 transitions. [2025-04-26 16:59:37,384 INFO L131 ngComponentsAnalysis]: Automaton has 14963 accepting balls. 55960 [2025-04-26 16:59:37,384 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:59:37,384 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:59:37,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:59:37,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:59:37,391 INFO L752 eck$LassoCheckResult]: Stem: "[159] $Ultimate##0-->L35: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[124] L35-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[126] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[162] L14-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[128] L44-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[130] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[165] L15-->L53: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:59:37,391 INFO L754 eck$LassoCheckResult]: Loop: "[133] L53-->L55: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[135] L55-->L53: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:59:37,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 498339265, now seen corresponding path program 1 times [2025-04-26 16:59:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:37,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596468143] [2025-04-26 16:59:37,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:37,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:59:37,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:59:37,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:37,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:37,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:59:37,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:59:37,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:37,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:37,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash 5219, now seen corresponding path program 1 times [2025-04-26 16:59:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:37,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804568435] [2025-04-26 16:59:37,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:37,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:37,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:37,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:37,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:37,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:37,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:37,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:37,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:37,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:37,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2132299229, now seen corresponding path program 1 times [2025-04-26 16:59:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:59:37,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391608130] [2025-04-26 16:59:37,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:59:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:59:37,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:37,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:37,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:37,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:59:37,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:59:37,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:59:37,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:59:37,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:59:37,426 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:37,426 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:37,426 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:37,426 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:37,426 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:59:37,426 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:37,427 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:37,427 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:37,427 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_8.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:59:37,427 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:37,427 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:37,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:37,442 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:37,442 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:59:37,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:37,444 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:37,445 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:37,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:59:37,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:37,463 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:37,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:37,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:37,465 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:37,465 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:37,468 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:59:37,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:59:37,528 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:59:37,532 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:37,532 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:59:37,532 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:59:37,532 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:59:37,532 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:59:37,533 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:59:37,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:37,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:59:37,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:59:37,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_8.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:59:37,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:59:37,533 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:59:37,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:59:37,548 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:59:37,548 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:59:37,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:37,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:37,550 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:37,551 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:37,552 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:37,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:59:37,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:59:37,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:59:37,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:59:37,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:59:37,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:59:37,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:59:37,565 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:59:37,567 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:59:37,567 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:59:37,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:59:37,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:59:37,569 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:37,571 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:37,572 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:59:37,574 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:37,575 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:59:37,575 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:59:37,575 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:59:37,579 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:37,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:59:37,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:59:37,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:59:37,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:59:37,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:37,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:59:37,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:37,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:59:37,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:59:37,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:59:37,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:59:37,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:59:37,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:59:37,627 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:37,628 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:59:37,628 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 259128 states and 1150067 transitions. cyclomatic complexity: 914629 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:45,390 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 259128 states and 1150067 transitions. cyclomatic complexity: 914629. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 686171 states and 3018341 transitions. Complement of second has 6 states. [2025-04-26 16:59:45,390 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:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:59:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-04-26 16:59:45,391 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 129 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:59:45,391 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:45,391 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 129 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:59:45,391 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:45,391 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 129 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:59:45,391 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:59:45,391 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686171 states and 3018341 transitions.