/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/buchiAutomizer/concurrent-automaton-noLbe.epf --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:51:45,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:51:45,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:51:45,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:51:45,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:51:45,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:51:45,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:51:45,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:51:45,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:51:45,986 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:51:45,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:51:45,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:51:45,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:51:45,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:51:45,987 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:51:45,987 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:51:46,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:51:46,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:51:46,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:51:46,245 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:51:46,246 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:51:46,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl [2025-02-17 22:51:46,248 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl' [2025-02-17 22:51:46,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:51:46,262 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:51:46,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:51:46,263 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:51:46,263 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:51:46,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,284 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:51:46,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:51:46,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:51:46,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:51:46,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:51:46,290 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,292 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:51:46,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:51:46,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:51:46,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:51:46,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/1) ... [2025-02-17 22:51:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:46,326 INFO L229 MonitoredProcess]: Starting monitored process 1 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-02-17 22:51:46,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-17 22:51:46,347 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:51:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:51:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:51:46,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:51:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:51:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:51:46,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:51:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:51:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:51:46,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:51:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:51:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:51:46,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:51:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:51:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:51:46,348 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-02-17 22:51:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-02-17 22:51:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-02-17 22:51:46,349 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:51:46,389 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:51:46,391 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:51:46,494 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:51:46,494 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:51:46,505 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:51:46,505 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:51:46,506 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:51:46 BoogieIcfgContainer [2025-02-17 22:51:46,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:51:46,508 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:51:46,508 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:51:46,512 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:51:46,513 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:51:46,513 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:51:46" (1/2) ... [2025-02-17 22:51:46,514 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eea7f4e and model type me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:51:46, skipping insertion in model container [2025-02-17 22:51:46,514 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:51:46,514 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:51:46" (2/2) ... [2025-02-17 22:51:46,515 INFO L363 chiAutomizerObserver]: Analyzing ICFG me1-5.c.bpl [2025-02-17 22:51:46,603 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-02-17 22:51:46,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 127 flow [2025-02-17 22:51:46,662 INFO L124 PetriNetUnfolderBase]: 5/36 cut-off events. [2025-02-17 22:51:46,664 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-17 22:51:46,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 5/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-02-17 22:51:46,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 127 flow [2025-02-17 22:51:46,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 102 flow [2025-02-17 22:51:46,677 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:51:48,047 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:51:48,047 INFO L101 AmpleReduction]: Number of pruned transitions: 4702, Number of non-trivial ample sets: 7106 [2025-02-17 22:51:48,047 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 5338 [2025-02-17 22:51:48,057 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:51:48,057 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:51:48,057 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:51:48,057 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:51:48,057 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:51:48,058 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:51:48,058 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:51:48,059 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:51:48,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3466 states, 3465 states have (on average 3.628282828282828) internal successors, (12572), 3465 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:48,180 INFO L131 ngComponentsAnalysis]: Automaton has 594 accepting balls. 2382 [2025-02-17 22:51:48,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:48,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:48,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:51:48,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:48,185 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:51:48,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3466 states, 3465 states have (on average 3.628282828282828) internal successors, (12572), 3465 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:48,245 INFO L131 ngComponentsAnalysis]: Automaton has 594 accepting balls. 2382 [2025-02-17 22:51:48,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:48,245 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:48,246 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:51:48,246 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:48,251 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:51:48,251 INFO L754 eck$LassoCheckResult]: Loop: "[90] L33-->L35: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[92] L35-->L33: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-02-17 22:51:48,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 3680, now seen corresponding path program 1 times [2025-02-17 22:51:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:48,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081653686] [2025-02-17 22:51:48,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:48,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:48,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:48,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:48,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:48,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:48,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:48,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:48,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:48,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:48,330 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-02-17 22:51:48,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:48,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363462357] [2025-02-17 22:51:48,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:48,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:48,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:48,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:48,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:48,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:48,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:48,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:48,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:48,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:48,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 3539362, now seen corresponding path program 1 times [2025-02-17 22:51:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:48,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693518060] [2025-02-17 22:51:48,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:48,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:48,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:48,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:48,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:48,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:51:48,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:51:48,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:48,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:48,382 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:48,382 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:48,384 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:48,384 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:48,384 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:48,384 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:48,384 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:48,384 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:48,384 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:51:48,384 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:48,384 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:48,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:48,450 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:48,451 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:48,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:48,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:48,456 INFO L229 MonitoredProcess]: Starting monitored process 2 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-02-17 22:51:48,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-17 22:51:48,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:48,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:48,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:48,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:48,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:48,511 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-02-17 22:51:48,513 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-02-17 22:51:48,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:48,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:48,598 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:48,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:48,603 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:48,603 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:48,603 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:48,603 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:48,603 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:48,603 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:48,603 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:48,603 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:48,603 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:51:48,603 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:48,603 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:48,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:48,629 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:48,632 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:48,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:48,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:48,636 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-02-17 22:51:48,638 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-02-17 22:51:48,639 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-02-17 22:51:48,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:48,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:48,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:48,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:48,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:48,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:48,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:48,664 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:48,670 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:48,670 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:48,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:48,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:48,676 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-02-17 22:51:48,678 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-02-17 22:51:48,679 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:48,679 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:48,680 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:48,680 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-02-17 22:51:48,687 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-02-17 22:51:48,689 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:48,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:48,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:48,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:48,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:48,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:48,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:48,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:48,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:48,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:48,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:48,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:48,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:48,782 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-02-17 22:51:48,791 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3466 states, 3465 states have (on average 3.628282828282828) internal successors, (12572), 3465 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:49,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3466 states, 3465 states have (on average 3.628282828282828) internal successors, (12572), 3465 states have internal predecessors, (12572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9670 states and 40486 transitions. Complement of second has 6 states. [2025-02-17 22:51:49,076 INFO L141 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-02-17 22:51:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-02-17 22:51:49,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:51:49,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:49,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:51:49,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:49,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:51:49,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:49,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9670 states and 40486 transitions. [2025-02-17 22:51:49,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-17 22:51:49,251 INFO L131 ngComponentsAnalysis]: Automaton has 693 accepting balls. 2200 [2025-02-17 22:51:49,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9670 states to 7246 states and 32145 transitions. [2025-02-17 22:51:49,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3255 [2025-02-17 22:51:49,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5217 [2025-02-17 22:51:49,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7246 states and 32145 transitions. [2025-02-17 22:51:49,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:49,376 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7246 states and 32145 transitions. [2025-02-17 22:51:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7246 states and 32145 transitions. [2025-02-17 22:51:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7246 to 5288. [2025-02-17 22:51:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5288 states, 5288 states have (on average 4.59947049924357) internal successors, (24322), 5287 states have internal predecessors, (24322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 24322 transitions. [2025-02-17 22:51:49,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5288 states and 24322 transitions. [2025-02-17 22:51:49,726 INFO L432 stractBuchiCegarLoop]: Abstraction has 5288 states and 24322 transitions. [2025-02-17 22:51:49,726 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:51:49,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5288 states and 24322 transitions. [2025-02-17 22:51:49,773 INFO L131 ngComponentsAnalysis]: Automaton has 693 accepting balls. 2200 [2025-02-17 22:51:49,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:49,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:49,774 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:51:49,774 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:49,775 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: 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-02-17 22:51:49,775 INFO L754 eck$LassoCheckResult]: Loop: "[94] L42-->L44: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[96] L44-->L42: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:51:49,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash 114198, now seen corresponding path program 1 times [2025-02-17 22:51:49,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:49,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942518733] [2025-02-17 22:51:49,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:49,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:51:49,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:51:49,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:49,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:49,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:49,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:51:49,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:51:49,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:49,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:49,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:49,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-02-17 22:51:49,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:49,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717119201] [2025-02-17 22:51:49,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:49,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:49,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:49,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:49,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:49,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:49,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:49,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:49,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:49,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:49,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:49,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:49,804 INFO L85 PathProgramCache]: Analyzing trace with hash 109747288, now seen corresponding path program 1 times [2025-02-17 22:51:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:49,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25887962] [2025-02-17 22:51:49,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:49,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:51:49,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:51:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:49,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:49,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:51:49,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:51:49,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:49,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:49,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:49,839 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:49,840 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:49,840 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:49,840 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:49,840 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:49,840 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:49,840 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:49,840 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:49,840 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:51:49,840 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:49,840 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:49,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:49,860 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:49,860 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:49,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:49,862 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-02-17 22:51:49,864 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-02-17 22:51:49,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:49,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:49,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-17 22:51:49,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:49,887 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-02-17 22:51:49,889 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-02-17 22:51:49,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:49,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:49,964 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:49,969 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-02-17 22:51:49,970 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:49,970 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:49,970 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:49,970 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:49,970 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:49,970 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:49,970 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:49,970 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:49,970 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:51:49,970 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:49,970 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:49,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:49,991 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:49,991 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:49,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:49,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:49,993 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-02-17 22:51:49,995 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-02-17 22:51:49,996 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-02-17 22:51:50,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:50,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:50,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:50,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:50,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:50,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:50,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:50,011 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:50,015 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:50,015 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:50,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:50,017 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-02-17 22:51:50,019 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-02-17 22:51:50,020 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:50,020 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:50,020 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:50,020 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-02-17 22:51:50,026 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-02-17 22:51:50,027 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:50,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:51:50,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:51:50,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:50,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:50,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:50,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:50,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:50,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:50,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:50,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:50,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:50,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:50,069 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-02-17 22:51:50,069 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5288 states and 24322 transitions. cyclomatic complexity: 19962 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:50,384 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-02-17 22:51:50,561 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5288 states and 24322 transitions. cyclomatic complexity: 19962. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19768 states and 93070 transitions. Complement of second has 7 states. [2025-02-17 22:51:50,562 INFO L141 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-02-17 22:51:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-02-17 22:51:50,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:51:50,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:50,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:51:50,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:50,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:51:50,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:50,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19768 states and 93070 transitions. [2025-02-17 22:51:50,879 INFO L131 ngComponentsAnalysis]: Automaton has 1282 accepting balls. 3455 [2025-02-17 22:51:51,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19768 states to 15032 states and 72221 transitions. [2025-02-17 22:51:51,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6795 [2025-02-17 22:51:51,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8453 [2025-02-17 22:51:51,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15032 states and 72221 transitions. [2025-02-17 22:51:51,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:51,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15032 states and 72221 transitions. [2025-02-17 22:51:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15032 states and 72221 transitions. [2025-02-17 22:51:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15032 to 10812. [2025-02-17 22:51:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10812 states, 10812 states have (on average 5.068072512023678) internal successors, (54796), 10811 states have internal predecessors, (54796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 54796 transitions. [2025-02-17 22:51:51,724 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10812 states and 54796 transitions. [2025-02-17 22:51:51,724 INFO L432 stractBuchiCegarLoop]: Abstraction has 10812 states and 54796 transitions. [2025-02-17 22:51:51,724 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:51:51,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10812 states and 54796 transitions. [2025-02-17 22:51:51,809 INFO L131 ngComponentsAnalysis]: Automaton has 947 accepting balls. 2707 [2025-02-17 22:51:51,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:51,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:51,811 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:51:51,811 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:51,811 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: 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]" "[121] L19-->$Ultimate##0: 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]" "[124] L20-->L62: 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]" [2025-02-17 22:51:51,811 INFO L754 eck$LassoCheckResult]: Loop: "[104] L62-->L64: Formula: (< v_x3_1 v_z3_1) InVars {z3=v_z3_1, x3=v_x3_1} OutVars{z3=v_z3_1, x3=v_x3_1} AuxVars[] AssignedVars[]" "[106] L64-->L62: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-02-17 22:51:51,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:51,812 INFO L85 PathProgramCache]: Analyzing trace with hash 109748153, now seen corresponding path program 1 times [2025-02-17 22:51:51,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880415233] [2025-02-17 22:51:51,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:51,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:51:51,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:51:51,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:51,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:51,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:51,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:51:51,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:51:51,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:51,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:51,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:51,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 1 times [2025-02-17 22:51:51,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:51,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448066282] [2025-02-17 22:51:51,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:51,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:51,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:51,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:51,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:51,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:51,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:51,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:51,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:51,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:51,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:51,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:51,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1906204037, now seen corresponding path program 1 times [2025-02-17 22:51:51,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:51,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505431718] [2025-02-17 22:51:51,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:51,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:51,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:51:51,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:51:51,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:51,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:51,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:51,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:51:51,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:51:51,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:51,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:51,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:51,891 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:51,891 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:51,891 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:51,891 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:51,891 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:51,891 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:51,891 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:51,891 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:51,891 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:51:51,892 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:51,892 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:51,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:51,913 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:51,913 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:51,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:51,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:51,915 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-02-17 22:51:51,917 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-02-17 22:51:51,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:51,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:51,935 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-02-17 22:51:51,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:51,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:51,938 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-02-17 22:51:51,939 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-02-17 22:51:51,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:51,940 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:52,009 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:52,014 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-02-17 22:51:52,014 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:52,014 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:52,014 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:52,015 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:52,015 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:52,015 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:52,015 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:52,015 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:52,015 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:51:52,015 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:52,015 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:52,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:52,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:52,035 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:52,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:52,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:52,038 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-02-17 22:51:52,040 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-02-17 22:51:52,041 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-02-17 22:51:52,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:52,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:52,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:52,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:52,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:52,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:52,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:52,056 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:52,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:51:52,059 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:52,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:52,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:52,061 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-02-17 22:51:52,062 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-02-17 22:51:52,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:52,064 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:52,064 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:52,064 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z3) = -1*x3 + 1*z3 Supporting invariants [] [2025-02-17 22:51:52,070 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-02-17 22:51:52,072 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:52,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:52,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:51:52,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:51:52,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:52,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:52,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:52,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:52,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:52,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:52,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:52,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:52,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:52,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:52,115 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-02-17 22:51:52,115 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10812 states and 54796 transitions. cyclomatic complexity: 45681 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:52,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10812 states and 54796 transitions. cyclomatic complexity: 45681. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37962 states and 196147 transitions. Complement of second has 7 states. [2025-02-17 22:51:52,813 INFO L141 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-02-17 22:51:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-02-17 22:51:52,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:51:52,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:52,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:51:52,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:52,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:51:52,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:52,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37962 states and 196147 transitions. [2025-02-17 22:51:53,616 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-02-17 22:51:53,626 INFO L131 ngComponentsAnalysis]: Automaton has 1436 accepting balls. 3727 [2025-02-17 22:51:54,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37962 states to 27806 states and 146166 transitions. [2025-02-17 22:51:54,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10335 [2025-02-17 22:51:54,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12280 [2025-02-17 22:51:54,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27806 states and 146166 transitions. [2025-02-17 22:51:54,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:54,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27806 states and 146166 transitions. [2025-02-17 22:51:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27806 states and 146166 transitions. [2025-02-17 22:51:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27806 to 21261. [2025-02-17 22:51:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21261 states, 21261 states have (on average 5.4183716664314945) internal successors, (115200), 21260 states have internal predecessors, (115200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21261 states to 21261 states and 115200 transitions. [2025-02-17 22:51:55,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21261 states and 115200 transitions. [2025-02-17 22:51:55,094 INFO L432 stractBuchiCegarLoop]: Abstraction has 21261 states and 115200 transitions. [2025-02-17 22:51:55,094 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:51:55,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21261 states and 115200 transitions. [2025-02-17 22:51:55,228 INFO L131 ngComponentsAnalysis]: Automaton has 1123 accepting balls. 3029 [2025-02-17 22:51:55,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:55,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:55,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-02-17 22:51:55,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:55,230 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: 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]" "[121] L19-->$Ultimate##0: 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]" "[98] $Ultimate##0-->L53-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[93] L42-->L46: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" [2025-02-17 22:51:55,230 INFO L754 eck$LassoCheckResult]: Loop: "[100] L53-1-->L55: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[102] L55-->L53-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-02-17 22:51:55,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash -892775266, now seen corresponding path program 1 times [2025-02-17 22:51:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122456791] [2025-02-17 22:51:55,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:55,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:55,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:55,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:55,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:55,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:51:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122456791] [2025-02-17 22:51:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122456791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:51:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:51:55,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:51:55,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870360079] [2025-02-17 22:51:55,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:51:55,273 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:51:55,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-02-17 22:51:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373976351] [2025-02-17 22:51:55,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:55,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:55,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:55,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:55,277 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:55,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:55,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:55,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:55,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:55,294 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:55,295 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:55,295 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:55,295 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:55,295 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:55,295 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,295 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:55,295 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:55,295 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:51:55,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:55,295 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:55,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:55,311 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:55,311 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,313 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-02-17 22:51:55,315 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-02-17 22:51:55,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:55,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:55,332 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-02-17 22:51:55,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,334 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-02-17 22:51:55,335 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-02-17 22:51:55,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:55,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:55,406 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:55,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:55,410 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:55,411 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:55,411 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:55,411 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:55,411 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:55,411 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,411 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:55,411 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:55,411 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:51:55,411 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:55,411 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:55,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:55,432 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:55,432 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:55,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,434 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-02-17 22:51:55,435 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-02-17 22:51:55,437 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-02-17 22:51:55,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:55,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:55,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:55,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:55,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:55,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:55,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:55,451 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:55,457 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:55,457 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:55,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:55,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:55,459 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-02-17 22:51:55,461 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-02-17 22:51:55,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:55,462 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:55,462 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:55,462 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, y2) = 1*x2 - 1*y2 Supporting invariants [] [2025-02-17 22:51:55,468 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-02-17 22:51:55,469 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:55,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:55,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:51:55,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:51:55,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:55,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:55,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:55,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:55,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:55,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:55,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:55,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:55,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:55,524 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-02-17 22:51:55,524 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21261 states and 115200 transitions. cyclomatic complexity: 96968 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:55,957 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-02-17 22:51:56,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21261 states and 115200 transitions. cyclomatic complexity: 96968. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36963 states and 193207 transitions. Complement of second has 6 states. [2025-02-17 22:51:56,054 INFO L141 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-02-17 22:51:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:56,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-02-17 22:51:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:51:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:51:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:56,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 6 letters. Loop has 4 letters. [2025-02-17 22:51:56,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:56,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36963 states and 193207 transitions. [2025-02-17 22:51:56,673 INFO L131 ngComponentsAnalysis]: Automaton has 977 accepting balls. 2607 [2025-02-17 22:51:57,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36963 states to 29667 states and 155386 transitions. [2025-02-17 22:51:57,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10141 [2025-02-17 22:51:57,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11716 [2025-02-17 22:51:57,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29667 states and 155386 transitions. [2025-02-17 22:51:57,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:57,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29667 states and 155386 transitions. [2025-02-17 22:51:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29667 states and 155386 transitions. [2025-02-17 22:51:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29667 to 27200. [2025-02-17 22:51:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27200 states, 27200 states have (on average 5.38827205882353) internal successors, (146561), 27199 states have internal predecessors, (146561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27200 states to 27200 states and 146561 transitions. [2025-02-17 22:51:58,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27200 states and 146561 transitions. [2025-02-17 22:51:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:51:58,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:51:58,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:51:58,085 INFO L87 Difference]: Start difference. First operand 27200 states and 146561 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:51:58,261 INFO L93 Difference]: Finished difference Result 9458 states and 44000 transitions. [2025-02-17 22:51:58,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9458 states and 44000 transitions. [2025-02-17 22:51:58,533 INFO L131 ngComponentsAnalysis]: Automaton has 290 accepting balls. 658 [2025-02-17 22:51:58,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9458 states to 8609 states and 40114 transitions. [2025-02-17 22:51:58,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3083 [2025-02-17 22:51:58,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3087 [2025-02-17 22:51:58,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8609 states and 40114 transitions. [2025-02-17 22:51:58,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:51:58,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8609 states and 40114 transitions. [2025-02-17 22:51:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8609 states and 40114 transitions. [2025-02-17 22:51:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8609 to 8603. [2025-02-17 22:51:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8603 states, 8603 states have (on average 4.662094618156457) internal successors, (40108), 8602 states have internal predecessors, (40108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8603 states to 8603 states and 40108 transitions. [2025-02-17 22:51:58,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8603 states and 40108 transitions. [2025-02-17 22:51:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:51:58,758 INFO L432 stractBuchiCegarLoop]: Abstraction has 8603 states and 40108 transitions. [2025-02-17 22:51:58,759 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:51:58,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8603 states and 40108 transitions. [2025-02-17 22:51:58,807 INFO L131 ngComponentsAnalysis]: Automaton has 290 accepting balls. 658 [2025-02-17 22:51:58,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:51:58,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:51:58,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:51:58,808 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:51:58,808 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] L18-1-->L42: 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]" "[121] L19-->$Ultimate##0: 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]" "[124] L20-->L62: 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]" "[103] L62-->L66: Formula: (<= v_z3_2 v_x3_4) InVars {z3=v_z3_2, x3=v_x3_4} OutVars{z3=v_z3_2, x3=v_x3_4} AuxVars[] AssignedVars[]" "[127] L21-->$Ultimate##0: 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]" "[108] $Ultimate##0-->L73-1: Formula: (< 0 v_h_4) InVars {h=v_h_4} OutVars{h=v_h_4} AuxVars[] AssignedVars[]" [2025-02-17 22:51:58,808 INFO L754 eck$LassoCheckResult]: Loop: "[110] L73-1-->L75: Formula: (< v_y3_1 v_x3_5) InVars {y3=v_y3_1, x3=v_x3_5} OutVars{y3=v_y3_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[112] L75-->L73-1: Formula: (= (+ v_x3_6 1) v_x3_7) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:51:58,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:58,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1037216795, now seen corresponding path program 1 times [2025-02-17 22:51:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276446382] [2025-02-17 22:51:58,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:58,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:58,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:58,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:58,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:51:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276446382] [2025-02-17 22:51:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276446382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:51:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:51:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-17 22:51:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597175137] [2025-02-17 22:51:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:51:58,846 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:51:58,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-02-17 22:51:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:51:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798207697] [2025-02-17 22:51:58,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:51:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:51:58,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:58,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:58,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:58,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:58,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:51:58,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:58,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:58,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:58,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:51:58,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:51:58,866 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:58,866 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:58,866 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:58,866 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:58,866 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:51:58,866 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:58,866 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:58,866 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:58,866 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:51:58,866 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:58,866 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:58,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:58,881 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:58,881 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:51:58,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:58,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:58,883 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-02-17 22:51:58,885 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-02-17 22:51:58,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:51:58,887 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:58,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-17 22:51:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:58,906 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-02-17 22:51:58,907 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-02-17 22:51:58,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:51:58,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:51:58,982 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:51:58,987 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-02-17 22:51:58,987 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:51:58,987 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:51:58,987 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:51:58,987 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:51:58,987 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:51:58,987 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:58,987 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:51:58,987 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:51:58,987 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:51:58,987 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:51:58,987 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:51:58,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:51:59,006 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:51:59,007 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:51:59,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:59,008 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-02-17 22:51:59,009 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-02-17 22:51:59,010 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-02-17 22:51:59,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:51:59,021 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:51:59,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:51:59,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:51:59,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:51:59,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:51:59,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:51:59,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:51:59,029 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:51:59,029 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:51:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:51:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:51:59,031 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-02-17 22:51:59,032 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-02-17 22:51:59,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:51:59,032 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:51:59,032 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:51:59,032 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, y3) = 1*x3 - 1*y3 Supporting invariants [] [2025-02-17 22:51:59,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-02-17 22:51:59,039 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:51:59,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:51:59,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:51:59,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:51:59,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:59,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:59,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:51:59,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:59,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:51:59,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:51:59,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:51:59,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:51:59,080 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:51:59,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:51:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:51:59,094 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-02-17 22:51:59,094 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8603 states and 40108 transitions. cyclomatic complexity: 32662 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:59,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-17 22:51:59,406 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8603 states and 40108 transitions. cyclomatic complexity: 32662. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23756 states and 108842 transitions. Complement of second has 7 states. [2025-02-17 22:51:59,407 INFO L141 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-02-17 22:51:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:51:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-17 22:51:59,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:51:59,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:59,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:51:59,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:59,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 100 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:51:59,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:51:59,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23756 states and 108842 transitions. [2025-02-17 22:51:59,645 INFO L131 ngComponentsAnalysis]: Automaton has 290 accepting balls. 658 [2025-02-17 22:51:59,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23756 states to 14469 states and 65953 transitions. [2025-02-17 22:51:59,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4456 [2025-02-17 22:52:00,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4748 [2025-02-17 22:52:00,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14469 states and 65953 transitions. [2025-02-17 22:52:00,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:52:00,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14469 states and 65953 transitions. [2025-02-17 22:52:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14469 states and 65953 transitions. [2025-02-17 22:52:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14469 to 10117. [2025-02-17 22:52:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10117 states, 10117 states have (on average 4.757833349807255) internal successors, (48135), 10116 states have internal predecessors, (48135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:52:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10117 states to 10117 states and 48135 transitions. [2025-02-17 22:52:00,229 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10117 states and 48135 transitions. [2025-02-17 22:52:00,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:52:00,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-17 22:52:00,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-17 22:52:00,230 INFO L87 Difference]: Start difference. First operand 10117 states and 48135 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:52:00,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:52:00,254 INFO L93 Difference]: Finished difference Result 2424 states and 9835 transitions. [2025-02-17 22:52:00,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2424 states and 9835 transitions. [2025-02-17 22:52:00,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:52:00,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2424 states to 0 states and 0 transitions. [2025-02-17 22:52:00,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:52:00,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:52:00,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:52:00,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:52:00,268 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:52:00,268 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:52:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-17 22:52:00,271 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:52:00,272 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:52:00,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:52:00,272 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:52:00,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:52:00,277 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:52:00 BoogieIcfgContainer [2025-02-17 22:52:00,277 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:52:00,278 INFO L158 Benchmark]: Toolchain (without parser) took 14015.88ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 83.7MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 724.7MB. Max. memory is 8.0GB. [2025-02-17 22:52:00,278 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:52:00,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.46ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 82.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:52:00,278 INFO L158 Benchmark]: Boogie Preprocessor took 11.38ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.6MB in the end (delta: 790.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:52:00,278 INFO L158 Benchmark]: RCFGBuilder took 208.76ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 72.3MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:52:00,278 INFO L158 Benchmark]: BuchiAutomizer took 13769.14ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 72.2MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 712.1MB. Max. memory is 8.0GB. [2025-02-17 22:52:00,279 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.25ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.46ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 82.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 11.38ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 81.6MB in the end (delta: 790.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 208.76ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 72.3MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 13769.14ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 72.2MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 712.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z3 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. One deterministic module has affine ranking function x3 + -1 * y3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.2s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 3.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 19548 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 4.0s Buchi closure took 0.3s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 374 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 282 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 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: 47ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 1.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 1420, Trivial Ample Sets caused by loops: 5338, Number of non-trivial ample sets: 7106, Number of pruned transitions: 4702, Number of transitions in reduction automaton: 12572, Number of states in reduction automaton: 3466, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:52:00,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...