/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/bb7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:49:09,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:49:09,856 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:49:09,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:49:09,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:49:09,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:49:09,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:49:09,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:49:09,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:49:09,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:49:09,882 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:49:09,882 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:49:09,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:49:09,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:49:09,884 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:49:09,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:49:09,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:49:09,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:49:09,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:49:09,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:49:09,884 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:49:09,885 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:49:10,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:49:10,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:49:10,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:49:10,198 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:49:10,199 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:49:10,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/bb7.c.bpl [2025-02-17 22:49:10,200 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/bb7.c.bpl' [2025-02-17 22:49:10,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:49:10,213 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:49:10,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:10,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:49:10,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:49:10,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,224 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,228 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:49:10,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:49:10,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:49:10,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:49:10,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:49:10,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,235 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:49:10,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:49:10,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:49:10,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:49:10,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/1) ... [2025-02-17 22:49:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:10,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:10,266 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:49:10,270 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:49:10,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:49:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:49:10,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:49:10,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:49:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:49:10,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:49:10,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:49:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:49:10,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:49:10,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:49:10,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:49:10,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:49:10,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-02-17 22:49:10,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-17 22:49:10,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-17 22:49:10,288 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:49:10,320 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:49:10,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:49:10,397 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:49:10,397 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:49:10,405 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:49:10,405 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:49:10,406 INFO L201 PluginConnector]: Adding new model bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:10 BoogieIcfgContainer [2025-02-17 22:49:10,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:49:10,406 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:49:10,406 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:49:10,410 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:49:10,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:10,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:49:10" (1/2) ... [2025-02-17 22:49:10,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@681cf14 and model type bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:49:10, skipping insertion in model container [2025-02-17 22:49:10,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:49:10,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:49:10" (2/2) ... [2025-02-17 22:49:10,412 INFO L363 chiAutomizerObserver]: Analyzing ICFG bb7.c.bpl [2025-02-17 22:49:10,472 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-17 22:49:10,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 54 transitions, 136 flow [2025-02-17 22:49:10,536 INFO L124 PetriNetUnfolderBase]: 8/46 cut-off events. [2025-02-17 22:49:10,538 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-17 22:49:10,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 8/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 114 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-02-17 22:49:10,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 54 transitions, 136 flow [2025-02-17 22:49:10,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 46 transitions, 116 flow [2025-02-17 22:49:10,552 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:49:12,233 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:49:12,234 INFO L101 AmpleReduction]: Number of pruned transitions: 6580, Number of non-trivial ample sets: 8250 [2025-02-17 22:49:12,234 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 6589 [2025-02-17 22:49:12,245 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:49:12,245 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:49:12,245 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:49:12,245 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:49:12,245 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:49:12,246 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:49:12,246 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:49:12,246 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:49:12,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5009 states, 5008 states have (on average 3.1218051118210863) internal successors, (15634), 5008 states have internal predecessors, (15634), 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:49:12,397 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-02-17 22:49:12,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:12,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:12,404 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:12,404 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:12,405 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:49:12,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5009 states, 5008 states have (on average 3.1218051118210863) internal successors, (15634), 5008 states have internal predecessors, (15634), 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:49:12,499 INFO L131 ngComponentsAnalysis]: Automaton has 859 accepting balls. 3316 [2025-02-17 22:49:12,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:12,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:12,499 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-17 22:49:12,499 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:12,503 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-02-17 22:49:12,503 INFO L754 eck$LassoCheckResult]: Loop: "[121] L26-->L28: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[123] L28-->L26: 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:49:12,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 4591, now seen corresponding path program 1 times [2025-02-17 22:49:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305068272] [2025-02-17 22:49:12,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,562 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash 4835, now seen corresponding path program 1 times [2025-02-17 22:49:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935276581] [2025-02-17 22:49:12,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,593 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:12,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:12,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:12,597 INFO L85 PathProgramCache]: Analyzing trace with hash 4415825, now seen corresponding path program 1 times [2025-02-17 22:49:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979280481] [2025-02-17 22:49:12,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:12,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:12,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:12,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,606 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:12,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:12,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:12,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:12,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:12,612 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:12,634 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:12,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:12,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:12,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:12,635 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:12,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:12,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:12,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:12,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:12,636 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:12,668 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:12,699 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:12,700 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,714 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:49:12,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:12,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:12,776 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:49:12,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-17 22:49:12,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,798 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:49:12,810 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:49:12,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:12,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:12,906 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:12,917 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:49:12,917 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:12,917 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:12,917 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:12,917 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:12,917 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:12,917 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:12,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:12,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:49:12,918 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:12,918 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:12,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:12,942 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:12,945 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:12,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,949 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:49:12,950 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:49:12,951 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:49:12,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:12,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:12,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:12,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:12,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:12,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:12,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:12,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:12,975 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:12,976 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:12,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:12,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:12,979 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:49:12,981 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:49:12,983 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:12,984 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:12,984 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:12,985 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-02-17 22:49:12,991 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:49:12,994 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:13,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:13,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:13,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:13,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:13,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:13,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:13,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:13,053 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:49:13,072 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:49:13,090 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 5009 states, 5008 states have (on average 3.1218051118210863) internal successors, (15634), 5008 states have internal predecessors, (15634), 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:49:13,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:13,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 5009 states, 5008 states have (on average 3.1218051118210863) internal successors, (15634), 5008 states have internal predecessors, (15634), 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 16216 states and 55251 transitions. Complement of second has 7 states. [2025-02-17 22:49:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:13,660 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:49:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-02-17 22:49:13,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 164 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-17 22:49:13,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 164 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:13,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 164 transitions. Stem has 2 letters. Loop has 4 letters. [2025-02-17 22:49:13,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:13,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16216 states and 55251 transitions. [2025-02-17 22:49:13,943 INFO L131 ngComponentsAnalysis]: Automaton has 1202 accepting balls. 3602 [2025-02-17 22:49:14,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16216 states to 13007 states and 45382 transitions. [2025-02-17 22:49:14,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5495 [2025-02-17 22:49:14,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7693 [2025-02-17 22:49:14,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13007 states and 45382 transitions. [2025-02-17 22:49:14,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:14,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13007 states and 45382 transitions. [2025-02-17 22:49:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13007 states and 45382 transitions. [2025-02-17 22:49:14,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13007 to 10811. [2025-02-17 22:49:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10811 states, 10811 states have (on average 3.543520488391453) internal successors, (38309), 10810 states have internal predecessors, (38309), 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:49:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10811 states to 10811 states and 38309 transitions. [2025-02-17 22:49:14,678 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10811 states and 38309 transitions. [2025-02-17 22:49:14,678 INFO L432 stractBuchiCegarLoop]: Abstraction has 10811 states and 38309 transitions. [2025-02-17 22:49:14,678 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:49:14,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10811 states and 38309 transitions. [2025-02-17 22:49:14,748 INFO L131 ngComponentsAnalysis]: Automaton has 1202 accepting balls. 3602 [2025-02-17 22:49:14,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:14,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:14,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:49:14,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:14,749 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:49:14,749 INFO L754 eck$LassoCheckResult]: Loop: "[130] L41-->L43: Formula: (< v_x3_5 v_z_5) InVars {x3=v_x3_5, z=v_z_5} OutVars{x3=v_x3_5, z=v_z_5} AuxVars[] AssignedVars[]" "[132] L43-->L41: Formula: (= (+ v_x3_7 1) v_x3_6) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-02-17 22:49:14,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,750 INFO L85 PathProgramCache]: Analyzing trace with hash 142482, now seen corresponding path program 1 times [2025-02-17 22:49:14,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887352959] [2025-02-17 22:49:14,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:14,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:14,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:14,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:14,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash 5123, now seen corresponding path program 1 times [2025-02-17 22:49:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828355236] [2025-02-17 22:49:14,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,764 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:14,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:14,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash 136929364, now seen corresponding path program 1 times [2025-02-17 22:49:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136844917] [2025-02-17 22:49:14,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:14,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:14,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:14,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:14,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:14,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:14,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:14,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:14,796 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,796 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,796 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,796 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,796 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:14,796 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,796 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,796 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,796 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:14,796 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,796 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,797 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,815 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,815 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:14,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,817 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:49:14,819 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:49:14,820 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:14,820 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,838 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:49:14,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,840 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:49:14,841 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:49:14,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:14,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:14,912 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:14,919 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:14,919 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:14,919 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:14,919 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:14,919 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:14,920 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,920 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:14,920 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:14,920 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:49:14,920 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:14,920 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:14,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:14,937 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:14,937 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:14,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,940 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:49:14,942 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:49:14,943 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:49:14,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:14,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:14,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:14,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:14,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:14,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:14,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:14,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:14,959 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:14,959 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:14,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:14,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:14,961 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:49:14,963 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:49:14,964 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:14,964 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:14,964 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:14,964 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-02-17 22:49:14,970 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:49:14,971 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:14,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:14,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:14,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:14,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:14,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:14,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:14,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:14,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:15,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:15,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:15,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:15,000 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:15,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:15,015 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:49:15,016 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:49:15,017 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10811 states and 38309 transitions. cyclomatic complexity: 29487 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:49:15,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:15,863 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10811 states and 38309 transitions. cyclomatic complexity: 29487. 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 38208 states and 144023 transitions. Complement of second has 7 states. [2025-02-17 22:49:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:15,865 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:49:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-02-17 22:49:15,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:49:15,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:15,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 166 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:49:15,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:15,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38208 states and 144023 transitions. [2025-02-17 22:49:16,501 INFO L131 ngComponentsAnalysis]: Automaton has 1286 accepting balls. 3132 [2025-02-17 22:49:16,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38208 states to 27039 states and 104020 transitions. [2025-02-17 22:49:16,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7725 [2025-02-17 22:49:16,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10586 [2025-02-17 22:49:16,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27039 states and 104020 transitions. [2025-02-17 22:49:16,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:16,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27039 states and 104020 transitions. [2025-02-17 22:49:16,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27039 states and 104020 transitions. [2025-02-17 22:49:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27039 to 24183. [2025-02-17 22:49:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24183 states, 24183 states have (on average 3.9428524169871397) internal successors, (95350), 24182 states have internal predecessors, (95350), 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:49:17,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24183 states to 24183 states and 95350 transitions. [2025-02-17 22:49:17,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24183 states and 95350 transitions. [2025-02-17 22:49:17,808 INFO L432 stractBuchiCegarLoop]: Abstraction has 24183 states and 95350 transitions. [2025-02-17 22:49:17,808 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:49:17,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24183 states and 95350 transitions. [2025-02-17 22:49:18,148 INFO L131 ngComponentsAnalysis]: Automaton has 1286 accepting balls. 3132 [2025-02-17 22:49:18,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:18,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:18,149 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:49:18,149 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:18,150 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[164] L14-->L56: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:49:18,150 INFO L754 eck$LassoCheckResult]: Loop: "[139] L56-->L58: Formula: (< v_x4_5 v_z_9) InVars {x4=v_x4_5, z=v_z_9} OutVars{x4=v_x4_5, z=v_z_9} AuxVars[] AssignedVars[]" "[141] L58-->L56: Formula: (= v_x4_6 (+ v_x4_7 1)) InVars {x4=v_x4_7} OutVars{x4=v_x4_6} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:18,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:18,151 INFO L85 PathProgramCache]: Analyzing trace with hash 4417106, now seen corresponding path program 1 times [2025-02-17 22:49:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:18,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689266102] [2025-02-17 22:49:18,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:18,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:18,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:18,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:18,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:18,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:18,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:18,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:18,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:18,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:18,169 INFO L85 PathProgramCache]: Analyzing trace with hash 5411, now seen corresponding path program 1 times [2025-02-17 22:49:18,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:18,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13136993] [2025-02-17 22:49:18,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:18,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:18,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:18,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:18,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:18,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:18,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:18,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:18,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:18,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:18,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:18,189 INFO L85 PathProgramCache]: Analyzing trace with hash -50123980, now seen corresponding path program 1 times [2025-02-17 22:49:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:18,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420984746] [2025-02-17 22:49:18,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:18,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:18,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:18,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:18,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:18,202 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:18,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:49:18,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:49:18,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:18,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:18,252 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:18,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:18,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:18,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:18,252 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:18,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:18,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:18,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:18,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:18,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:18,252 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:18,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:18,278 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:18,278 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:18,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:18,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:18,280 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:49:18,286 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:49:18,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:18,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:18,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-02-17 22:49:18,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:18,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:18,305 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:49:18,306 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:49:18,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:18,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:18,376 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:18,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:18,381 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:18,382 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:18,382 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:18,382 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:18,382 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:18,382 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:18,382 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:18,382 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:18,382 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:49:18,382 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:18,382 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:18,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:18,401 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:18,402 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:18,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:18,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:18,405 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:49:18,406 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:49:18,407 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:49:18,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:18,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:18,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:18,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:18,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:18,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:18,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:18,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:18,430 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:18,430 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:18,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:18,435 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:49:18,437 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:49:18,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:18,441 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:18,442 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:18,442 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:18,458 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:49:18,459 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:18,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:18,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:49:18,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:49:18,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:18,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:18,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:18,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:18,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:18,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:18,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:18,498 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:18,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:18,518 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:49:18,519 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:49:18,519 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24183 states and 95350 transitions. cyclomatic complexity: 74935 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:49:19,035 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:49:19,496 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24183 states and 95350 transitions. cyclomatic complexity: 74935. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Result 86776 states and 353263 transitions. Complement of second has 7 states. [2025-02-17 22:49:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:49:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-02-17 22:49:19,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 174 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:49:19,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:19,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 174 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:49:19,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:19,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 174 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:49:19,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:19,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86776 states and 353263 transitions. [2025-02-17 22:49:21,166 INFO L131 ngComponentsAnalysis]: Automaton has 1008 accepting balls. 2146 [2025-02-17 22:49:21,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86776 states to 55911 states and 231123 transitions. [2025-02-17 22:49:21,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12211 [2025-02-17 22:49:21,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14711 [2025-02-17 22:49:21,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55911 states and 231123 transitions. [2025-02-17 22:49:21,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:21,991 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55911 states and 231123 transitions. [2025-02-17 22:49:22,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55911 states and 231123 transitions. [2025-02-17 22:49:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55911 to 51591. [2025-02-17 22:49:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51591 states, 51591 states have (on average 4.209416371072474) internal successors, (217168), 51590 states have internal predecessors, (217168), 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:49:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51591 states to 51591 states and 217168 transitions. [2025-02-17 22:49:23,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51591 states and 217168 transitions. [2025-02-17 22:49:23,826 INFO L432 stractBuchiCegarLoop]: Abstraction has 51591 states and 217168 transitions. [2025-02-17 22:49:23,826 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:49:23,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51591 states and 217168 transitions. [2025-02-17 22:49:24,337 INFO L131 ngComponentsAnalysis]: Automaton has 1008 accepting balls. 2146 [2025-02-17 22:49:24,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:24,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:24,338 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:24,338 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:24,338 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[164] L14-->L56: 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]" "[167] L15-->L71: 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:49:24,339 INFO L754 eck$LassoCheckResult]: Loop: "[148] L71-->L73: Formula: (< v_x5_5 v_z_15) InVars {x5=v_x5_5, z=v_z_15} OutVars{x5=v_x5_5, z=v_z_15} AuxVars[] AssignedVars[]" "[150] L73-->L71: Formula: (= v_x5_6 (+ v_x5_7 1)) InVars {x5=v_x5_7} OutVars{x5=v_x5_6} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash 136930453, now seen corresponding path program 1 times [2025-02-17 22:49:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:24,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568308336] [2025-02-17 22:49:24,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:24,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:24,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:24,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:24,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:24,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:24,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:24,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:24,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:24,346 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:24,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:24,346 INFO L85 PathProgramCache]: Analyzing trace with hash 5699, now seen corresponding path program 1 times [2025-02-17 22:49:24,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:24,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673926965] [2025-02-17 22:49:24,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:24,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:24,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:24,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:24,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:24,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:24,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:24,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:24,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:24,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:24,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:24,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1553816105, now seen corresponding path program 1 times [2025-02-17 22:49:24,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:24,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142429895] [2025-02-17 22:49:24,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:24,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:24,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:24,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:24,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:24,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:49:24,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:49:24,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:24,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:24,369 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:24,369 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:24,369 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:24,369 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:24,369 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:24,369 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:24,369 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:24,369 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:24,369 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:24,369 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:24,369 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:24,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:24,383 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:24,383 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:24,385 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:49:24,387 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:49:24,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:24,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:24,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:24,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:24,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:24,408 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:49:24,410 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:49:24,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:24,411 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:24,475 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:24,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-02-17 22:49:24,479 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:24,479 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:24,479 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:24,479 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:24,479 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:24,479 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:24,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:24,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:24,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:24,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:24,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:24,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:24,501 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:24,501 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:24,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:24,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:24,505 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:49:24,506 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:49:24,507 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:49:24,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:24,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:24,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:24,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:24,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:24,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:24,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:24,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:24,526 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:24,526 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:24,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:24,529 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:49:24,530 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:49:24,531 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:24,531 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:24,531 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:24,531 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-02-17 22:49:24,537 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:49:24,538 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:24,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:24,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:24,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:24,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:24,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:24,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:24,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:24,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:24,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:24,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:24,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:24,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:24,580 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:49:24,581 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:49:24,581 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51591 states and 217168 transitions. cyclomatic complexity: 172464 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:49:24,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:49:26,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51591 states and 217168 transitions. cyclomatic complexity: 172464. 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 168132 states and 716363 transitions. Complement of second has 7 states. [2025-02-17 22:49:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:26,653 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:49:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-02-17 22:49:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:26,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168132 states and 716363 transitions. [2025-02-17 22:49:29,591 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 120 [2025-02-17 22:49:29,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168132 states to 3184 states and 10335 transitions. [2025-02-17 22:49:29,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 921 [2025-02-17 22:49:29,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 921 [2025-02-17 22:49:29,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3184 states and 10335 transitions. [2025-02-17 22:49:29,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:29,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3184 states and 10335 transitions. [2025-02-17 22:49:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3184 states and 10335 transitions. [2025-02-17 22:49:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3184 to 3182. [2025-02-17 22:49:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3182 states have (on average 3.24732872407291) internal successors, (10333), 3181 states have internal predecessors, (10333), 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:49:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 10333 transitions. [2025-02-17 22:49:29,650 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3182 states and 10333 transitions. [2025-02-17 22:49:29,650 INFO L432 stractBuchiCegarLoop]: Abstraction has 3182 states and 10333 transitions. [2025-02-17 22:49:29,650 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:29,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3182 states and 10333 transitions. [2025-02-17 22:49:29,661 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 120 [2025-02-17 22:49:29,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:29,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:29,661 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:49:29,661 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:29,662 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[124] L31-->L32-1: Formula: (<= 4 v_x2_3) InVars {x2=v_x2_3} OutVars{x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-02-17 22:49:29,662 INFO L754 eck$LassoCheckResult]: Loop: "[126] L32-1-->L34: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[128] L34-->L32-1: 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:49:29,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash 136889707, now seen corresponding path program 1 times [2025-02-17 22:49:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:29,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045113327] [2025-02-17 22:49:29,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:29,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:29,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:29,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:29,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:29,706 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:49:29,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045113327] [2025-02-17 22:49:29,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045113327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:29,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:29,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-17 22:49:29,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630222067] [2025-02-17 22:49:29,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:29,712 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:29,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:29,712 INFO L85 PathProgramCache]: Analyzing trace with hash 4995, now seen corresponding path program 1 times [2025-02-17 22:49:29,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:29,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765852730] [2025-02-17 22:49:29,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:29,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:29,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:29,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:29,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:29,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:29,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:29,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:29,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:29,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:29,734 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:29,734 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:29,734 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:29,734 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:29,734 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:29,734 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:29,734 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:29,734 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:29,734 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:29,734 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:29,734 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:29,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:29,749 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:29,749 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:29,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:29,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:29,751 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:49:29,753 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:49:29,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:29,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:29,772 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:49:29,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:29,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:29,775 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:49:29,776 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:49:29,777 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:29,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:29,844 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:29,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-17 22:49:29,848 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:29,848 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:29,848 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:29,848 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:29,849 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:29,849 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:29,849 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:29,849 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:29,849 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration5_Loop [2025-02-17 22:49:29,849 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:29,849 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:29,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:29,864 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:29,864 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:29,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:29,867 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:49:29,868 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:49:29,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-17 22:49:29,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:29,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:29,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:29,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:29,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:29,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:29,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:29,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:29,883 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:29,883 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:29,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:29,885 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:49:29,887 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:49:29,888 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:29,888 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:29,888 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:29,888 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-02-17 22:49:29,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:29,894 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:29,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:29,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:29,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:29,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:29,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:29,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:29,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:29,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:29,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:29,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:29,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:29,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:29,941 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:49:29,942 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:49:29,942 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3182 states and 10333 transitions. cyclomatic complexity: 7586 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:49:30,054 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3182 states and 10333 transitions. cyclomatic complexity: 7586. 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 6850 states and 23791 transitions. Complement of second has 7 states. [2025-02-17 22:49:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:30,057 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:49:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-02-17 22:49:30,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:49:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 7 letters. Loop has 2 letters. [2025-02-17 22:49:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:30,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 108 transitions. Stem has 5 letters. Loop has 4 letters. [2025-02-17 22:49:30,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:30,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6850 states and 23791 transitions. [2025-02-17 22:49:30,109 INFO L131 ngComponentsAnalysis]: Automaton has 60 accepting balls. 120 [2025-02-17 22:49:30,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6850 states to 4231 states and 13890 transitions. [2025-02-17 22:49:30,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 960 [2025-02-17 22:49:30,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1136 [2025-02-17 22:49:30,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4231 states and 13890 transitions. [2025-02-17 22:49:30,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:30,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4231 states and 13890 transitions. [2025-02-17 22:49:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states and 13890 transitions. [2025-02-17 22:49:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 3281. [2025-02-17 22:49:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 3281 states have (on average 3.2581530021334957) internal successors, (10690), 3280 states have internal predecessors, (10690), 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:49:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 10690 transitions. [2025-02-17 22:49:30,184 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3281 states and 10690 transitions. [2025-02-17 22:49:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:30,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:49:30,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:49:30,189 INFO L87 Difference]: Start difference. First operand 3281 states and 10690 transitions. Second operand has 4 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:49:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:30,240 INFO L93 Difference]: Finished difference Result 2109 states and 6625 transitions. [2025-02-17 22:49:30,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2109 states and 6625 transitions. [2025-02-17 22:49:30,251 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 100 [2025-02-17 22:49:30,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2109 states to 2099 states and 6579 transitions. [2025-02-17 22:49:30,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2025-02-17 22:49:30,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 594 [2025-02-17 22:49:30,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2099 states and 6579 transitions. [2025-02-17 22:49:30,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:30,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2099 states and 6579 transitions. [2025-02-17 22:49:30,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states and 6579 transitions. [2025-02-17 22:49:30,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-02-17 22:49:30,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2099. [2025-02-17 22:49:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2099 states, 2099 states have (on average 3.134349690328728) internal successors, (6579), 2098 states have internal predecessors, (6579), 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:49:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2099 states to 2099 states and 6579 transitions. [2025-02-17 22:49:30,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2099 states and 6579 transitions. [2025-02-17 22:49:30,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-17 22:49:30,387 INFO L432 stractBuchiCegarLoop]: Abstraction has 2099 states and 6579 transitions. [2025-02-17 22:49:30,387 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-17 22:49:30,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2099 states and 6579 transitions. [2025-02-17 22:49:30,393 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 100 [2025-02-17 22:49:30,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:30,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:30,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:30,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:30,394 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[129] L41-->L45: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[133] L46-->L47-1: Formula: (<= 4 v_x2_6) InVars {x2=v_x2_6} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[]" [2025-02-17 22:49:30,394 INFO L754 eck$LassoCheckResult]: Loop: "[135] L47-1-->L49: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[137] L49-->L47-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-02-17 22:49:30,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -957082353, now seen corresponding path program 1 times [2025-02-17 22:49:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:30,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972938398] [2025-02-17 22:49:30,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:30,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:30,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:30,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:30,451 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:49:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:30,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972938398] [2025-02-17 22:49:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972938398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:49:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277644336] [2025-02-17 22:49:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:30,452 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:30,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash 5283, now seen corresponding path program 1 times [2025-02-17 22:49:30,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:30,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389588275] [2025-02-17 22:49:30,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:30,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:30,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:30,475 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:30,475 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:30,475 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:30,475 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:30,475 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:30,475 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,475 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:30,475 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:30,475 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:30,475 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:30,475 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:30,475 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:30,489 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:30,490 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:30,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:30,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-17 22:49:30,495 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:30,495 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:30,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-17 22:49:30,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,514 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:30,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-17 22:49:30,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:30,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:30,586 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:30,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-17 22:49:30,590 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:30,590 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:30,590 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:30,590 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:30,590 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:30,590 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,590 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:30,590 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:30,590 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration6_Loop [2025-02-17 22:49:30,590 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:30,590 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:30,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:30,610 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:30,611 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:30,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,614 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:30,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-17 22:49:30,616 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:49:30,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:30,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:30,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:30,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:30,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:30,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:30,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:30,631 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:30,634 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:30,634 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:30,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,636 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:30,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-17 22:49:30,639 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:30,639 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:30,640 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:30,640 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-02-17 22:49:30,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:30,645 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-17 22:49:30,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-17 22:49:30,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:30,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:30,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:30,678 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:30,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:30,689 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:49:30,690 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:49:30,690 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2099 states and 6579 transitions. cyclomatic complexity: 4793 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:49:30,750 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2099 states and 6579 transitions. cyclomatic complexity: 4793. 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 4230 states and 13858 transitions. Complement of second has 7 states. [2025-02-17 22:49:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-02-17 22:49:30,750 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:49:30,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-02-17 22:49:30,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 8 letters. Loop has 2 letters. [2025-02-17 22:49:30,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:30,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 10 letters. Loop has 2 letters. [2025-02-17 22:49:30,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:30,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 8 letters. Loop has 4 letters. [2025-02-17 22:49:30,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:30,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4230 states and 13858 transitions. [2025-02-17 22:49:30,771 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 94 [2025-02-17 22:49:30,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4230 states to 2703 states and 8302 transitions. [2025-02-17 22:49:30,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 635 [2025-02-17 22:49:30,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 756 [2025-02-17 22:49:30,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2703 states and 8302 transitions. [2025-02-17 22:49:30,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:30,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2703 states and 8302 transitions. [2025-02-17 22:49:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states and 8302 transitions. [2025-02-17 22:49:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2172. [2025-02-17 22:49:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2172 states have (on average 3.1284530386740332) internal successors, (6795), 2171 states have internal predecessors, (6795), 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:49:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 6795 transitions. [2025-02-17 22:49:30,803 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2172 states and 6795 transitions. [2025-02-17 22:49:30,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:30,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-17 22:49:30,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-17 22:49:30,803 INFO L87 Difference]: Start difference. First operand 2172 states and 6795 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:49:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:30,829 INFO L93 Difference]: Finished difference Result 859 states and 2513 transitions. [2025-02-17 22:49:30,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 2513 transitions. [2025-02-17 22:49:30,834 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 36 [2025-02-17 22:49:30,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 726 states and 2075 transitions. [2025-02-17 22:49:30,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2025-02-17 22:49:30,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2025-02-17 22:49:30,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 726 states and 2075 transitions. [2025-02-17 22:49:30,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:49:30,836 INFO L218 hiAutomatonCegarLoop]: Abstraction has 726 states and 2075 transitions. [2025-02-17 22:49:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states and 2075 transitions. [2025-02-17 22:49:30,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2025-02-17 22:49:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 726 states have (on average 2.8581267217630852) internal successors, (2075), 725 states have internal predecessors, (2075), 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:49:30,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2075 transitions. [2025-02-17 22:49:30,841 INFO L240 hiAutomatonCegarLoop]: Abstraction has 726 states and 2075 transitions. [2025-02-17 22:49:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-17 22:49:30,842 INFO L432 stractBuchiCegarLoop]: Abstraction has 726 states and 2075 transitions. [2025-02-17 22:49:30,842 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-17 22:49:30,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 726 states and 2075 transitions. [2025-02-17 22:49:30,844 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 36 [2025-02-17 22:49:30,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:49:30,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:49:30,844 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-17 22:49:30,844 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:49:30,844 INFO L752 eck$LassoCheckResult]: Stem: "[112] $Ultimate##0-->L13: Formula: (= v_x2_10 0) InVars {} OutVars{x2=v_x2_10} AuxVars[] AssignedVars[x2]" "[158] L13-->L26: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[161] L13-1-->L41: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[129] L41-->L45: Formula: (<= v_z_6 v_x3_8) InVars {x3=v_x3_8, z=v_z_6} OutVars{x3=v_x3_8, z=v_z_6} AuxVars[] AssignedVars[]" "[131] L45-->L46: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[164] L14-->L56: 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]" "[120] L26-->L30: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[122] L30-->L31: Formula: (= v_x2_1 (+ v_x2_2 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" "[138] L56-->L60: Formula: (<= v_z_10 v_x4_8) InVars {x4=v_x4_8, z=v_z_10} OutVars{x4=v_x4_8, z=v_z_10} AuxVars[] AssignedVars[]" "[140] L60-->L61: Formula: (= v_x2_7 (+ v_x2_8 1)) InVars {x2=v_x2_8} OutVars{x2=v_x2_7} AuxVars[] AssignedVars[x2]" "[142] L61-->L62-1: Formula: (<= 4 v_x2_9) InVars {x2=v_x2_9} OutVars{x2=v_x2_9} AuxVars[] AssignedVars[]" [2025-02-17 22:49:30,845 INFO L754 eck$LassoCheckResult]: Loop: "[144] L62-1-->L64: Formula: (< v_x5_1 v_z_11) InVars {x5=v_x5_1, z=v_z_11} OutVars{x5=v_x5_1, z=v_z_11} AuxVars[] AssignedVars[]" "[146] L64-->L62-1: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" [2025-02-17 22:49:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1189822374, now seen corresponding path program 1 times [2025-02-17 22:49:30,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:30,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408949354] [2025-02-17 22:49:30,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:30,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:30,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:49:30,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:49:30,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:30,906 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:49:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:49:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408949354] [2025-02-17 22:49:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408949354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:49:30,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:49:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-17 22:49:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556882932] [2025-02-17 22:49:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:49:30,907 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:49:30,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:30,907 INFO L85 PathProgramCache]: Analyzing trace with hash 5571, now seen corresponding path program 1 times [2025-02-17 22:49:30,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:49:30,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381924259] [2025-02-17 22:49:30,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:49:30,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:49:30,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:49:30,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:30,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:30,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:30,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:49:30,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:49:30,926 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:30,926 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:30,926 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:30,926 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:30,926 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:49:30,926 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,927 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:30,927 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:30,927 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:30,927 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:30,927 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:30,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:30,947 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:30,947 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:49:30,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,949 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:30,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-17 22:49:30,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:49:30,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:30,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-17 22:49:30,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:30,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:30,969 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:30,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-17 22:49:30,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:49:30,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:31,032 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:31,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-17 22:49:31,036 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:31,036 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:31,036 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:31,036 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:31,036 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:31,036 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:31,036 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:31,036 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:31,036 INFO L132 ssoRankerPreferences]: Filename of dumped script: bb7.c.bpl_petrified1_Iteration7_Loop [2025-02-17 22:49:31,036 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:31,036 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:31,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:31,049 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:31,050 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:31,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:31,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:31,052 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:31,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-17 22:49:31,053 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:49:31,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:31,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:31,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:31,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:31,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:31,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:31,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:31,065 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:31,067 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-17 22:49:31,067 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:49:31,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:31,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:31,069 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-17 22:49:31,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-17 22:49:31,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:31,070 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:31,070 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:31,070 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(x5, z) = -1*x5 + 1*z Supporting invariants [] [2025-02-17 22:49:31,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-17 22:49:31,076 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:31,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:31,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-17 22:49:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-17 22:49:31,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:31,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:31,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:31,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:31,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:49:31,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:49:31,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:31,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:31,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:31,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:31,120 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:49:31,120 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:49:31,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 726 states and 2075 transitions. cyclomatic complexity: 1452 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:49:31,148 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 726 states and 2075 transitions. cyclomatic complexity: 1452. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 1133 states and 3340 transitions. Complement of second has 6 states. [2025-02-17 22:49:31,148 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:49:31,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:49:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-02-17 22:49:31,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 11 letters. Loop has 2 letters. [2025-02-17 22:49:31,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:31,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 13 letters. Loop has 2 letters. [2025-02-17 22:49:31,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:31,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 11 letters. Loop has 4 letters. [2025-02-17 22:49:31,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:31,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1133 states and 3340 transitions. [2025-02-17 22:49:31,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:31,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1133 states to 0 states and 0 transitions. [2025-02-17 22:49:31,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:31,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:31,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:31,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:31,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:31,157 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:31,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-17 22:49:31,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-17 22:49:31,157 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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:49:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:31,157 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:49:31,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:49:31,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:31,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:49:31,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:31,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:31,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:31,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:31,157 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:31,158 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:49:31,158 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:31,158 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-02-17 22:49:31,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:31,158 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:31,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:31,166 INFO L201 PluginConnector]: Adding new model bb7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:31 BoogieIcfgContainer [2025-02-17 22:49:31,166 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:31,167 INFO L158 Benchmark]: Toolchain (without parser) took 20953.66ms. Allocated memory was 155.2MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 85.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-02-17 22:49:31,167 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:31,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.27ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 84.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:31,167 INFO L158 Benchmark]: Boogie Preprocessor took 10.10ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 83.8MB in the end (delta: 771.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:31,167 INFO L158 Benchmark]: RCFGBuilder took 166.04ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 74.1MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-02-17 22:49:31,169 INFO L158 Benchmark]: BuchiAutomizer took 20759.87ms. Allocated memory was 155.2MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 73.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-02-17 22:49:31,170 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.16ms. Allocated memory is still 155.2MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 15.27ms. Allocated memory is still 155.2MB. Free memory was 85.7MB in the beginning and 84.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 10.10ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 83.8MB in the end (delta: 771.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 166.04ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 74.1MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 20759.87ms. Allocated memory was 155.2MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 73.9MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 1.6GB. 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 10 terminating modules (3 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 5 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.6s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.3s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 3.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 10855 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 6.9s Buchi closure took 0.1s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 717 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 354 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 363 mSDtfsCounter, 593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT3 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: 38ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 1.7s InitialAbstraction: Time to compute Ample Reduction [ms]: 1736, Trivial Ample Sets caused by loops: 6589, Number of non-trivial ample sets: 8250, Number of pruned transitions: 6580, Number of transitions in reduction automaton: 15634, Number of states in reduction automaton: 5009, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:31,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:31,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:31,584 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...