/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_7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:51,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:51,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:51,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:51,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:51,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:51,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:51,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:51,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:51,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:51,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:51,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:51,190 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:51,190 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:51,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:51,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:51,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:51,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:51,192 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:51,192 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:51,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:51,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:51,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:51,440 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:51,440 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:51,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_7.c.bpl [2025-04-26 18:42:51,441 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_7.c.bpl' [2025-04-26 18:42:51,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:51,461 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:51,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:51,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:51,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:51,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,500 INFO L138 Inliner]: procedures = 8, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:51,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:51,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:51,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:51,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:51,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:51,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:51,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:51,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:51,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/1) ... [2025-04-26 18:42:51,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:51,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:51,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:51,577 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:51,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:51,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:51,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:51,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:42:51,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:42:51,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:42:51,578 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:42:51,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:42:51,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:42:51,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 18:42:51,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 18:42:51,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 18:42:51,579 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread7 given in one single declaration [2025-04-26 18:42:51,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread7 [2025-04-26 18:42:51,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread7 [2025-04-26 18:42:51,579 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:51,615 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:51,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:51,690 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:51,691 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:51,701 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:51,701 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:51,704 INFO L201 PluginConnector]: Adding new model indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:51 BoogieIcfgContainer [2025-04-26 18:42:51,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:51,705 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:51,705 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:51,709 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:51,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:51,710 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:51" (1/2) ... [2025-04-26 18:42:51,711 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7eff3b18 and model type indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:51, skipping insertion in model container [2025-04-26 18:42:51,712 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:51,712 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:51" (2/2) ... [2025-04-26 18:42:51,713 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_7.c.bpl [2025-04-26 18:42:51,772 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-04-26 18:42:51,803 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:51,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:51,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:51,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 163 flow [2025-04-26 18:42:51,892 INFO L116 PetriNetUnfolderBase]: 7/43 cut-off events. [2025-04-26 18:42:51,894 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 18:42:51,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 43 events. 7/43 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-04-26 18:42:51,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 163 flow [2025-04-26 18:42:51,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 43 transitions, 128 flow [2025-04-26 18:42:51,900 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 58 places, 43 transitions, 128 flow [2025-04-26 18:42:51,901 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 43 transitions, 128 flow [2025-04-26 18:42:53,150 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27307 states, 27306 states have (on average 6.866879074196147) internal successors, (in total 187507), 27306 states have internal predecessors, (187507), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:53,222 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 27307 states, 27306 states have (on average 6.866879074196147) internal successors, (in total 187507), 27306 states have internal predecessors, (187507), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:53,225 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:55,231 WARN L140 AmpleReduction]: Number of pruned transitions: 73851 [2025-04-26 18:42:55,231 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:55,231 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 13455 [2025-04-26 18:42:55,231 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:36 [2025-04-26 18:42:55,231 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:13815 [2025-04-26 18:42:55,231 WARN L145 AmpleReduction]: Times succ was already a loop node:44146 [2025-04-26 18:42:55,231 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:9452 [2025-04-26 18:42:55,231 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:55,303 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:55,310 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:55,310 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:55,310 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:55,310 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:55,310 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:55,311 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:55,311 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:55,311 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:55,367 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:56,049 INFO L131 ngComponentsAnalysis]: Automaton has 3991 accepting balls. 26924 [2025-04-26 18:42:56,050 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:56,050 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:56,064 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:56,064 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:56,064 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:56,109 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:56,567 INFO L131 ngComponentsAnalysis]: Automaton has 3991 accepting balls. 26924 [2025-04-26 18:42:56,567 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:56,567 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:56,569 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:56,569 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:56,573 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:56,574 INFO L754 eck$LassoCheckResult]: Loop: "[108] L32-->L34: 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[]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:56,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2025-04-26 18:42:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:56,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088866873] [2025-04-26 18:42:56,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:56,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:56,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:56,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:56,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:56,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:56,633 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:56,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:56,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:56,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:56,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:56,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:56,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash 4419, now seen corresponding path program 1 times [2025-04-26 18:42:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:56,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89049630] [2025-04-26 18:42:56,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:56,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:56,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:56,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:56,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:56,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:56,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:56,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:56,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:56,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:56,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:56,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:56,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash 164906, now seen corresponding path program 1 times [2025-04-26 18:42:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:56,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551797804] [2025-04-26 18:42:56,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:56,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:56,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:56,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:56,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:56,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:56,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:56,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:56,746 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:56,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:56,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:56,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:56,747 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:56,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:56,748 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:56,748 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:56,748 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:56,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:56,748 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:56,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:56,854 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:56,854 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:56,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:56,864 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:56,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:56,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:56,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:56,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:56,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:56,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:56,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:56,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:56,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:57,045 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:57,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:57,054 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:57,054 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:57,054 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:57,054 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:57,054 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:57,054 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:57,055 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:57,055 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:57,055 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:57,055 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:57,055 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:57,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:57,090 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:57,093 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:57,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:57,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:57,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:57,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:57,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:57,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:57,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:57,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:57,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:57,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:57,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:57,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:57,142 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:57,148 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:57,148 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:57,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:57,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:57,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:57,154 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:57,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:57,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:57,162 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:57,163 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:57,163 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:57,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:57,184 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:57,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:57,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:57,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:57,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:57,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:57,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:57,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:57,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:57,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:57,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:57,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:57,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:57,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:57,320 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:57,366 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 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 18:42:58,394 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 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 65530 states and 271685 transitions. Complement of second has 6 states. [2025-04-26 18:42:58,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:58,398 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 18:42:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-26 18:42:58,406 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:58,407 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:58,407 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:58,408 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:58,408 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:58,408 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:58,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65530 states and 271685 transitions. [2025-04-26 18:42:59,465 INFO L131 ngComponentsAnalysis]: Automaton has 2898 accepting balls. 16002 [2025-04-26 18:43:00,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65530 states to 37713 states and 155981 transitions. [2025-04-26 18:43:00,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16126 [2025-04-26 18:43:00,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24221 [2025-04-26 18:43:00,188 INFO L74 IsDeterministic]: Start isDeterministic. Operand 37713 states and 155981 transitions. [2025-04-26 18:43:00,188 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:00,189 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37713 states and 155981 transitions. [2025-04-26 18:43:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37713 states and 155981 transitions. [2025-04-26 18:43:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37713 to 32320. [2025-04-26 18:43:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32320 states, 32320 states have (on average 4.130012376237624) internal successors, (in total 133482), 32319 states have internal predecessors, (133482), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32320 states to 32320 states and 133482 transitions. [2025-04-26 18:43:01,322 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32320 states and 133482 transitions. [2025-04-26 18:43:01,322 INFO L438 stractBuchiCegarLoop]: Abstraction has 32320 states and 133482 transitions. [2025-04-26 18:43:01,322 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:43:01,322 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32320 states and 133482 transitions. [2025-04-26 18:43:01,493 INFO L131 ngComponentsAnalysis]: Automaton has 2898 accepting balls. 16002 [2025-04-26 18:43:01,493 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:01,493 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:01,495 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:43:01,495 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:01,495 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[107] L32-->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[]" "[109] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L13-->L41: 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 18:43:01,495 INFO L754 eck$LassoCheckResult]: Loop: "[112] L41-->L43: 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[]" "[114] L43-->L41: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:43:01,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 5111234, now seen corresponding path program 1 times [2025-04-26 18:43:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:01,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956157799] [2025-04-26 18:43:01,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:01,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:01,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:01,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:01,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:01,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:01,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:01,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:01,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:01,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:01,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:01,504 INFO L85 PathProgramCache]: Analyzing trace with hash 4547, now seen corresponding path program 1 times [2025-04-26 18:43:01,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:01,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295750445] [2025-04-26 18:43:01,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:01,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:01,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:01,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:01,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:01,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:01,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:01,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:01,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:01,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:01,510 INFO L85 PathProgramCache]: Analyzing trace with hash 616932164, now seen corresponding path program 1 times [2025-04-26 18:43:01,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:01,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131935527] [2025-04-26 18:43:01,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:01,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:01,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:01,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:01,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:01,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:01,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:43:01,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:43:01,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:01,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:01,533 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:01,533 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:01,533 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:01,533 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:01,533 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:01,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:01,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:01,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:01,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:01,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:01,533 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:01,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:01,553 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:01,553 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:01,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:01,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:01,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:01,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:43:01,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:01,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:01,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:43:01,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:01,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:01,761 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:01,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:43:01,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:01,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:01,846 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:01,851 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 18:43:01,851 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:01,851 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:01,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:01,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:01,852 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:01,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:01,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:01,852 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:01,852 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:43:01,852 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:01,852 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:01,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:01,872 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:01,872 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:01,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:01,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:43:01,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:01,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:01,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:01,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:01,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:01,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:01,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:01,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:01,896 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:01,900 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:01,901 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:01,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:01,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:43:01,906 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:01,909 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:43:01,911 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 18:43:01,911 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:01,911 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:01,911 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:43:01,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:43:01,920 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:01,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:01,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:43:01,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:43:01,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:01,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:01,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:01,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:01,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:01,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:01,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:01,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:01,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:01,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:01,972 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:01,972 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32320 states and 133482 transitions. cyclomatic complexity: 105089 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:03,097 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32320 states and 133482 transitions. cyclomatic complexity: 105089. 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 85454 states and 355677 transitions. Complement of second has 6 states. [2025-04-26 18:43:03,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:03,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-04-26 18:43:03,098 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:43:03,098 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:03,098 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:43:03,098 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:03,098 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:43:03,098 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:03,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85454 states and 355677 transitions. [2025-04-26 18:43:04,398 INFO L131 ngComponentsAnalysis]: Automaton has 1927 accepting balls. 8494 [2025-04-26 18:43:05,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85454 states to 53739 states and 218981 transitions. [2025-04-26 18:43:05,042 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18448 [2025-04-26 18:43:05,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25266 [2025-04-26 18:43:05,128 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53739 states and 218981 transitions. [2025-04-26 18:43:05,129 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:05,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53739 states and 218981 transitions. [2025-04-26 18:43:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states and 218981 transitions. [2025-04-26 18:43:06,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 46921. [2025-04-26 18:43:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46921 states, 46921 states have (on average 4.125444896741331) internal successors, (in total 193570), 46920 states have internal predecessors, (193570), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46921 states to 46921 states and 193570 transitions. [2025-04-26 18:43:06,765 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46921 states and 193570 transitions. [2025-04-26 18:43:06,765 INFO L438 stractBuchiCegarLoop]: Abstraction has 46921 states and 193570 transitions. [2025-04-26 18:43:06,766 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:43:06,766 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46921 states and 193570 transitions. [2025-04-26 18:43:07,013 INFO L131 ngComponentsAnalysis]: Automaton has 1927 accepting balls. 8494 [2025-04-26 18:43:07,013 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:07,013 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:07,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:07,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:07,014 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[107] L32-->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[]" "[109] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L13-->L41: 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]" "[111] L41-->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[]" "[113] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L14-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:43:07,014 INFO L754 eck$LassoCheckResult]: Loop: "[116] L50-->L52: 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[]" "[118] L52-->L50: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:43:07,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:07,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1945027051, now seen corresponding path program 1 times [2025-04-26 18:43:07,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:07,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957638880] [2025-04-26 18:43:07,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:07,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:07,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:07,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:07,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:07,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:07,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:07,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:07,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:07,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:07,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:07,027 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2025-04-26 18:43:07,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:07,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121583222] [2025-04-26 18:43:07,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:07,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:07,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:07,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:07,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:07,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:07,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:07,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:07,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash 860225965, now seen corresponding path program 1 times [2025-04-26 18:43:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:07,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929742456] [2025-04-26 18:43:07,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:07,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:07,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:07,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:07,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:07,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:07,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:07,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:07,072 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:07,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:07,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:07,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:07,073 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:07,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:07,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:07,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:07,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:07,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:07,073 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:07,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:07,088 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:07,088 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:07,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:07,090 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:07,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:43:07,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:07,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:07,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:43:07,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:07,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:07,111 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:07,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:43:07,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:07,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:07,181 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:07,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:43:07,185 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:07,186 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:07,186 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:07,186 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:07,186 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:07,186 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:07,186 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:07,186 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:07,186 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:43:07,186 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:07,186 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:07,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:07,202 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:07,202 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:07,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:07,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:43:07,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:07,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:07,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:07,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:07,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:07,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:07,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:07,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:07,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:07,221 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:07,221 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:07,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:07,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:07,223 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:07,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:43:07,224 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:07,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:43:07,227 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:07,227 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:07,227 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:43:07,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:43:07,233 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:07,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:07,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:43:07,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:43:07,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:07,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:07,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:07,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:07,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:07,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:07,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:07,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:07,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:07,281 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:07,281 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46921 states and 193570 transitions. cyclomatic complexity: 150780 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:08,841 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46921 states and 193570 transitions. cyclomatic complexity: 150780. 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 126434 states and 521262 transitions. Complement of second has 6 states. [2025-04-26 18:43:08,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-26 18:43:08,842 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:43:08,842 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:08,842 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:43:08,842 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:08,842 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:43:08,842 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:08,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126434 states and 521262 transitions. [2025-04-26 18:43:10,702 INFO L131 ngComponentsAnalysis]: Automaton has 1200 accepting balls. 4230 [2025-04-26 18:43:11,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126434 states to 77865 states and 314330 transitions. [2025-04-26 18:43:11,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21924 [2025-04-26 18:43:11,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26005 [2025-04-26 18:43:11,840 INFO L74 IsDeterministic]: Start isDeterministic. Operand 77865 states and 314330 transitions. [2025-04-26 18:43:11,840 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:11,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77865 states and 314330 transitions. [2025-04-26 18:43:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77865 states and 314330 transitions. [2025-04-26 18:43:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77865 to 72731. [2025-04-26 18:43:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72731 states, 72731 states have (on average 3.978303611939888) internal successors, (in total 289346), 72730 states have internal predecessors, (289346), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72731 states to 72731 states and 289346 transitions. [2025-04-26 18:43:13,988 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72731 states and 289346 transitions. [2025-04-26 18:43:13,988 INFO L438 stractBuchiCegarLoop]: Abstraction has 72731 states and 289346 transitions. [2025-04-26 18:43:13,988 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:43:13,988 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72731 states and 289346 transitions. [2025-04-26 18:43:14,705 INFO L131 ngComponentsAnalysis]: Automaton has 1200 accepting balls. 4230 [2025-04-26 18:43:14,705 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:14,705 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:14,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:14,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:14,706 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: 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]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->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[]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:43:14,706 INFO L754 eck$LassoCheckResult]: Loop: "[120] L59-->L61: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[122] L61-->L59: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:43:14,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash -778618540, now seen corresponding path program 1 times [2025-04-26 18:43:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:14,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922646802] [2025-04-26 18:43:14,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:14,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:14,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:14,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:14,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:14,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:14,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:14,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:14,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:14,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:14,723 INFO L85 PathProgramCache]: Analyzing trace with hash 4803, now seen corresponding path program 1 times [2025-04-26 18:43:14,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:14,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716958366] [2025-04-26 18:43:14,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:14,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:14,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:14,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:14,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:14,726 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:14,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:14,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:14,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:14,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:14,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash -928103594, now seen corresponding path program 1 times [2025-04-26 18:43:14,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:14,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121085286] [2025-04-26 18:43:14,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:14,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:14,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:14,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:14,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:14,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:14,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:14,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:14,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:14,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:14,761 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:14,761 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:14,761 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:14,761 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:14,761 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:14,761 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:14,761 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:14,761 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:14,761 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:14,761 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:14,761 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:14,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:14,779 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:14,779 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:14,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:14,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:14,781 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:14,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:43:14,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:14,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:14,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:43:14,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:14,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:14,800 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:14,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:43:14,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:14,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:14,868 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:14,872 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 18:43:14,872 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:14,872 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:14,872 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:14,872 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:14,872 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:14,872 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:14,872 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:14,872 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:14,872 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:43:14,872 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:14,872 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:14,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:14,889 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:14,889 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:14,892 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:14,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:43:14,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:14,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:14,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:14,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:14,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:14,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:14,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:14,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:14,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:14,913 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:14,913 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:14,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:14,915 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:14,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:43:14,918 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:14,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:14,921 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:14,921 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:14,921 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:43:14,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:14,928 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:14,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:14,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:43:14,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:43:14,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:14,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:14,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:14,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:14,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:14,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:14,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:14,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:14,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:14,974 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:14,974 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72731 states and 289346 transitions. cyclomatic complexity: 221492 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:16,405 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72731 states and 289346 transitions. cyclomatic complexity: 221492. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 132955 states and 523551 transitions. Complement of second has 6 states. [2025-04-26 18:43:16,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-04-26 18:43:16,407 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:43:16,407 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:16,407 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:43:16,407 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:16,407 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:43:16,407 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:16,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132955 states and 523551 transitions. [2025-04-26 18:43:18,434 INFO L131 ngComponentsAnalysis]: Automaton has 691 accepting balls. 1974 [2025-04-26 18:43:19,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132955 states to 103687 states and 400845 transitions. [2025-04-26 18:43:19,675 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29244 [2025-04-26 18:43:19,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32820 [2025-04-26 18:43:19,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 103687 states and 400845 transitions. [2025-04-26 18:43:19,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:19,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103687 states and 400845 transitions. [2025-04-26 18:43:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103687 states and 400845 transitions. [2025-04-26 18:43:21,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103687 to 96673. [2025-04-26 18:43:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96673 states, 96673 states have (on average 3.909819701467835) internal successors, (in total 377974), 96672 states have internal predecessors, (377974), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96673 states to 96673 states and 377974 transitions. [2025-04-26 18:43:22,793 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96673 states and 377974 transitions. [2025-04-26 18:43:22,793 INFO L438 stractBuchiCegarLoop]: Abstraction has 96673 states and 377974 transitions. [2025-04-26 18:43:22,793 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:43:22,793 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96673 states and 377974 transitions. [2025-04-26 18:43:23,380 INFO L131 ngComponentsAnalysis]: Automaton has 691 accepting balls. 1974 [2025-04-26 18:43:23,380 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:23,380 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:23,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:23,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:23,382 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: 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]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->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[]" "[149] L16-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[119] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" [2025-04-26 18:43:23,382 INFO L754 eck$LassoCheckResult]: Loop: "[124] L68-->L70: Formula: (< v_x5_2 v_z_10) InVars {x5=v_x5_2, z=v_z_10} OutVars{x5=v_x5_2, z=v_z_10} AuxVars[] AssignedVars[]" "[126] L70-->L68: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 18:43:23,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:23,382 INFO L85 PathProgramCache]: Analyzing trace with hash -928071078, now seen corresponding path program 1 times [2025-04-26 18:43:23,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:23,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723661532] [2025-04-26 18:43:23,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:23,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:23,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:23,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:23,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:23,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:23,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:23,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:23,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:23,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:23,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 4931, now seen corresponding path program 1 times [2025-04-26 18:43:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:23,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842706073] [2025-04-26 18:43:23,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:23,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:23,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:23,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:23,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:23,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:23,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:23,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:23,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:23,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1476895580, now seen corresponding path program 1 times [2025-04-26 18:43:23,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:23,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497278059] [2025-04-26 18:43:23,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:23,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:23,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:43:23,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:43:23,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:23,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:23,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:43:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:43:23,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:23,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:23,691 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:23,691 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:23,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:23,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:23,691 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:23,692 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:23,692 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:23,692 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:23,692 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:43:23,692 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:23,692 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:23,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:23,721 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:23,722 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:23,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:23,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:23,724 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:23,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:43:23,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:23,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:23,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:23,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:23,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:23,745 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:23,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:43:23,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:23,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:23,839 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:23,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:23,844 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:23,844 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:23,844 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:23,845 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:23,845 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:23,845 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:23,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:23,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:23,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:43:23,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:23,845 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:23,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:23,862 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:23,863 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:23,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:23,865 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:23,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:43:23,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:23,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:23,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:23,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:23,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:23,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:23,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:23,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:23,890 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:23,892 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:43:23,892 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:43:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:23,897 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:43:23,902 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:23,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:43:23,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:43:23,905 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:23,905 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:23,906 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:43:23,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:43:23,922 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:23,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:23,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:43:23,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:43:23,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:23,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:23,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:23,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:23,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:23,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:23,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:23,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:23,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:23,988 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:23,988 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96673 states and 377974 transitions. cyclomatic complexity: 287368 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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 18:43:26,288 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96673 states and 377974 transitions. cyclomatic complexity: 287368. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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 181122 states and 687159 transitions. Complement of second has 6 states. [2025-04-26 18:43:26,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 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 18:43:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-04-26 18:43:26,289 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:43:26,289 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:26,289 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:43:26,290 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:26,290 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:43:26,290 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:26,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181122 states and 687159 transitions. [2025-04-26 18:43:28,927 INFO L131 ngComponentsAnalysis]: Automaton has 348 accepting balls. 822 [2025-04-26 18:43:30,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181122 states to 129800 states and 486937 transitions. [2025-04-26 18:43:30,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34065 [2025-04-26 18:43:30,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35903 [2025-04-26 18:43:30,842 INFO L74 IsDeterministic]: Start isDeterministic. Operand 129800 states and 486937 transitions. [2025-04-26 18:43:30,842 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:30,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129800 states and 486937 transitions. [2025-04-26 18:43:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129800 states and 486937 transitions. [2025-04-26 18:43:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129800 to 123621. [2025-04-26 18:43:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123621 states, 123621 states have (on average 3.7760251090025156) internal successors, (in total 466796), 123620 states have internal predecessors, (466796), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123621 states to 123621 states and 466796 transitions. [2025-04-26 18:43:34,560 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123621 states and 466796 transitions. [2025-04-26 18:43:34,561 INFO L438 stractBuchiCegarLoop]: Abstraction has 123621 states and 466796 transitions. [2025-04-26 18:43:34,561 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:43:34,561 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123621 states and 466796 transitions. [2025-04-26 18:43:35,478 INFO L131 ngComponentsAnalysis]: Automaton has 348 accepting balls. 822 [2025-04-26 18:43:35,478 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:35,478 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:35,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:35,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:35,480 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: 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]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->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[]" "[149] L16-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[152] L17-->L77: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[119] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" "[123] L68-->thread5FINAL: Formula: (<= v_z_9 v_x5_1) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" [2025-04-26 18:43:35,481 INFO L754 eck$LassoCheckResult]: Loop: "[128] L77-->L79: Formula: (< v_x6_1 v_z_11) InVars {x6=v_x6_1, z=v_z_11} OutVars{x6=v_x6_1, z=v_z_11} AuxVars[] AssignedVars[]" "[130] L79-->L77: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-04-26 18:43:35,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1476927135, now seen corresponding path program 1 times [2025-04-26 18:43:35,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790368161] [2025-04-26 18:43:35,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:43:35,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:43:35,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:43:35,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:43:35,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash 5059, now seen corresponding path program 1 times [2025-04-26 18:43:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070327884] [2025-04-26 18:43:35,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,507 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1987773153, now seen corresponding path program 1 times [2025-04-26 18:43:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:35,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092319398] [2025-04-26 18:43:35,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:35,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:35,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:43:35,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:43:35,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:35,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:43:35,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:43:35,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:35,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:35,546 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:35,546 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:35,546 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:35,546 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:35,546 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:35,546 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:35,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:35,547 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:43:35,547 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:35,547 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:35,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:35,562 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:35,563 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:35,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,565 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 18:43:35,566 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 18:43:35,570 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:35,570 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:35,587 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 18:43:35,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,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 18:43:35,590 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 18:43:35,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:35,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:35,652 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:35,657 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 18:43:35,657 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:35,657 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:35,657 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:35,657 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:35,657 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:35,657 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,657 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:35,657 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:35,657 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:43:35,657 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:35,658 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:35,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:35,670 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:35,670 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:35,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,672 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 18:43:35,673 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 18:43:35,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:35,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:35,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:35,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:35,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:35,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:35,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:35,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:35,686 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:35,689 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:35,689 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:35,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:35,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:35,691 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 18:43:35,692 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 18:43:35,693 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:35,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:43:35,696 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:35,696 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:35,697 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-04-26 18:43:35,701 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 18:43:35,702 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:35,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:35,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:43:35,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:43:35,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:35,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:35,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:35,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:35,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:35,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:35,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:35,743 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:35,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:35,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:35,754 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:35,754 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123621 states and 466796 transitions. cyclomatic complexity: 350902 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:38,064 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123621 states and 466796 transitions. cyclomatic complexity: 350902. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 231944 states and 855609 transitions. Complement of second has 6 states. [2025-04-26 18:43:38,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-04-26 18:43:38,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:43:38,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:38,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:43:38,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:38,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:43:38,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:38,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231944 states and 855609 transitions. [2025-04-26 18:43:41,372 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 254 [2025-04-26 18:43:43,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231944 states to 138845 states and 505393 transitions. [2025-04-26 18:43:43,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33879 [2025-04-26 18:43:43,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34817 [2025-04-26 18:43:43,153 INFO L74 IsDeterministic]: Start isDeterministic. Operand 138845 states and 505393 transitions. [2025-04-26 18:43:43,153 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:43:43,153 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138845 states and 505393 transitions. [2025-04-26 18:43:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138845 states and 505393 transitions. [2025-04-26 18:43:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138845 to 132923. [2025-04-26 18:43:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132923 states, 132923 states have (on average 3.6507526914078077) internal successors, (in total 485269), 132922 states have internal predecessors, (485269), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:43:47,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132923 states to 132923 states and 485269 transitions. [2025-04-26 18:43:47,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132923 states and 485269 transitions. [2025-04-26 18:43:47,251 INFO L438 stractBuchiCegarLoop]: Abstraction has 132923 states and 485269 transitions. [2025-04-26 18:43:47,251 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:43:47,251 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132923 states and 485269 transitions. [2025-04-26 18:43:48,077 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 254 [2025-04-26 18:43:48,077 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:43:48,077 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:43:48,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:43:48,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:43:48,079 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: 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]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->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[]" "[149] L16-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[152] L17-->L77: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[119] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" "[155] L18-->L86: Formula: (and (= v_thread7Thread1of1ForFork6_thidvar1_2 7) (= v_thread7Thread1of1ForFork6_thidvar3_2 7) (= v_thread7Thread1of1ForFork6_thidvar0_2 7) (= v_thread7Thread1of1ForFork6_thidvar2_2 7) (= v_thread7Thread1of1ForFork6_thidvar6_2 7) (= v_thread7Thread1of1ForFork6_thidvar5_2 7) (= v_thread7Thread1of1ForFork6_thidvar4_2 7)) InVars {} OutVars{thread7Thread1of1ForFork6_thidvar6=v_thread7Thread1of1ForFork6_thidvar6_2, thread7Thread1of1ForFork6_thidvar1=v_thread7Thread1of1ForFork6_thidvar1_2, thread7Thread1of1ForFork6_thidvar0=v_thread7Thread1of1ForFork6_thidvar0_2, thread7Thread1of1ForFork6_thidvar5=v_thread7Thread1of1ForFork6_thidvar5_2, thread7Thread1of1ForFork6_thidvar4=v_thread7Thread1of1ForFork6_thidvar4_2, thread7Thread1of1ForFork6_thidvar3=v_thread7Thread1of1ForFork6_thidvar3_2, thread7Thread1of1ForFork6_thidvar2=v_thread7Thread1of1ForFork6_thidvar2_2} AuxVars[] AssignedVars[thread7Thread1of1ForFork6_thidvar6, thread7Thread1of1ForFork6_thidvar1, thread7Thread1of1ForFork6_thidvar0, thread7Thread1of1ForFork6_thidvar5, thread7Thread1of1ForFork6_thidvar4, thread7Thread1of1ForFork6_thidvar3, thread7Thread1of1ForFork6_thidvar2]" "[123] L68-->thread5FINAL: Formula: (<= v_z_9 v_x5_1) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[127] L77-->thread6FINAL: Formula: (<= v_z_12 v_x6_4) InVars {x6=v_x6_4, z=v_z_12} OutVars{x6=v_x6_4, z=v_z_12} AuxVars[] AssignedVars[]" [2025-04-26 18:43:48,079 INFO L754 eck$LassoCheckResult]: Loop: "[132] L86-->L88: Formula: (< v_x7_1 v_z_13) InVars {x7=v_x7_1, z=v_z_13} OutVars{x7=v_x7_1, z=v_z_13} AuxVars[] AssignedVars[]" "[134] L88-->L86: Formula: (= v_x7_2 (+ v_x7_3 1)) InVars {x7=v_x7_3} OutVars{x7=v_x7_2} AuxVars[] AssignedVars[x7]" [2025-04-26 18:43:48,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1987803747, now seen corresponding path program 1 times [2025-04-26 18:43:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:48,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668226583] [2025-04-26 18:43:48,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:48,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:43:48,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:43:48,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:48,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:48,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:43:48,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:43:48,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:48,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:48,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 5187, now seen corresponding path program 1 times [2025-04-26 18:43:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:48,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470068366] [2025-04-26 18:43:48,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:48,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:48,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:48,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:48,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:48,106 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:48,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:48,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:48,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:48,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:48,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash -981041627, now seen corresponding path program 1 times [2025-04-26 18:43:48,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:43:48,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648958988] [2025-04-26 18:43:48,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:43:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:43:48,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:43:48,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:43:48,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:48,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:43:48,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:43:48,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:43:48,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:43:48,130 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:43:48,143 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:48,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:48,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:48,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:48,143 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:43:48,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:48,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:48,143 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:48,143 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:43:48,143 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:48,143 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:48,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:48,158 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:48,158 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:43:48,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:48,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:48,160 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 18:43:48,161 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 18:43:48,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:43:48,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:48,178 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 18:43:48,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:48,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:48,180 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 18:43:48,181 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 18:43:48,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:43:48,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:43:48,250 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:43:48,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:43:48,254 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:43:48,254 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:43:48,254 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:43:48,255 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:43:48,255 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:43:48,255 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:48,255 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:43:48,255 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:43:48,255 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration7_Loop [2025-04-26 18:43:48,255 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:43:48,255 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:43:48,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:43:48,455 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:43:48,456 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:43:48,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:48,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:48,458 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 18:43:48,458 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 18:43:48,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:43:48,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:43:48,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:43:48,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:43:48,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:43:48,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:43:48,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:43:48,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:43:48,472 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:43:48,475 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:43:48,475 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:43:48,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:43:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:43:48,477 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 18:43:48,477 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 18:43:48,478 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:43:48,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 18:43:48,481 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:43:48,481 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:43:48,481 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x7, z) = -1*x7 + 1*z Supporting invariants [] [2025-04-26 18:43:48,487 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 18:43:48,488 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:43:48,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:43:48,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:43:48,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:43:48,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:48,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:43:48,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:48,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:43:48,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:43:48,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:43:48,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:43:48,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:43:48,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:43:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:43:48,545 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:43:48,545 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132923 states and 485269 transitions. cyclomatic complexity: 361205 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 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 18:43:50,940 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132923 states and 485269 transitions. cyclomatic complexity: 361205. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 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 250312 states and 892904 transitions. Complement of second has 6 states. [2025-04-26 18:43:50,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:43:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 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 18:43:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-04-26 18:43:50,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:43:50,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:50,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 18:43:50,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:50,942 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 18:43:50,942 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:43:50,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250312 states and 892904 transitions. [2025-04-26 18:43:54,532 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:54,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250312 states to 0 states and 0 transitions. [2025-04-26 18:43:54,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:43:54,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:43:54,533 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:43:54,533 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:43:54,533 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:54,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:54,533 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:43:54,533 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:43:54,533 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:43:54,533 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:43:54,533 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:43:54,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:43:54,553 INFO L201 PluginConnector]: Adding new model indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:43:54 BoogieIcfgContainer [2025-04-26 18:43:54,553 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:43:54,554 INFO L158 Benchmark]: Toolchain (without parser) took 63092.53ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 85.9MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2025-04-26 18:43:54,554 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:54,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.40ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 83.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:43:54,554 INFO L158 Benchmark]: Boogie Preprocessor took 28.00ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:43:54,554 INFO L158 Benchmark]: RCFGBuilder took 173.26ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 72.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:43:54,555 INFO L158 Benchmark]: BuchiAutomizer took 62847.87ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 72.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2025-04-26 18:43:54,556 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.40ms. Allocated memory is still 159.4MB. Free memory was 85.9MB in the beginning and 83.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.00ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 173.26ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 72.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 62847.87ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 72.5MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 62.7s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 2.6s. Construction of modules took 0.4s. Büchi inclusion checks took 12.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 15.8s AutomataMinimizationTime, 6 MinimizatonAttempts, 36460 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 22.6s Buchi closure took 0.7s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 611 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 244 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 741 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 275 mSDtfsCounter, 741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT7 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 69ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 3.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 3432, Number of transitions in reduction automaton: 113656, Number of states in reduction automaton: 27307, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (0 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x7 and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:43:54,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...