NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-21 23:57:08,945 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-21 23:57:08,947 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-21 23:57:08,958 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-21 23:57:08,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-21 23:57:08,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-21 23:57:08,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-21 23:57:08,962 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-21 23:57:08,964 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-21 23:57:08,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-21 23:57:08,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-21 23:57:08,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-21 23:57:08,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-21 23:57:08,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-21 23:57:08,969 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-21 23:57:08,969 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-21 23:57:08,970 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-21 23:57:08,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-21 23:57:08,973 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-21 23:57:08,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-21 23:57:08,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-21 23:57:08,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-21 23:57:08,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-21 23:57:08,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-21 23:57:08,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-21 23:57:08,980 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-21 23:57:08,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-21 23:57:08,981 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-21 23:57:08,982 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-21 23:57:08,983 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-21 23:57:08,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-21 23:57:08,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-21 23:57:08,985 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-21 23:57:08,985 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-21 23:57:08,986 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-21 23:57:08,986 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-21 23:57:08,986 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-21 23:57:08,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-21 23:57:08,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-21 23:57:08,988 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-21 23:57:09,002 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-21 23:57:09,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-21 23:57:09,003 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-21 23:57:09,004 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-21 23:57:09,004 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-21 23:57:09,004 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-21 23:57:09,004 INFO L133 SettingsManager]: * Use SBE=true [2020-06-21 23:57:09,004 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-21 23:57:09,004 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-21 23:57:09,005 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-21 23:57:09,005 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-21 23:57:09,005 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-21 23:57:09,005 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-21 23:57:09,005 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-21 23:57:09,005 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:09,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-21 23:57:09,006 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-21 23:57:09,006 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-21 23:57:09,006 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-21 23:57:09,006 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-21 23:57:09,006 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-21 23:57:09,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-21 23:57:09,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-21 23:57:09,007 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-21 23:57:09,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 23:57:09,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-21 23:57:09,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-21 23:57:09,007 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-21 23:57:09,008 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-21 23:57:09,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-21 23:57:09,046 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-21 23:57:09,049 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-21 23:57:09,051 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-21 23:57:09,051 INFO L276 PluginConnector]: CDTParser initialized [2020-06-21 23:57:09,052 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-21 23:57:09,114 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/ffc39360f4814f6997c27141d24c279a/FLAG39d0053ca [2020-06-21 23:57:09,453 INFO L307 CDTParser]: Found 1 translation units. [2020-06-21 23:57:09,454 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-21 23:57:09,460 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/ffc39360f4814f6997c27141d24c279a/FLAG39d0053ca [2020-06-21 23:57:09,861 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/ffc39360f4814f6997c27141d24c279a [2020-06-21 23:57:09,872 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-21 23:57:09,874 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-21 23:57:09,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-21 23:57:09,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-21 23:57:09,878 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-21 23:57:09,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 11:57:09" (1/1) ... [2020-06-21 23:57:09,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@492f9cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:09, skipping insertion in model container [2020-06-21 23:57:09,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.06 11:57:09" (1/1) ... [2020-06-21 23:57:09,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-21 23:57:09,908 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-21 23:57:10,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 23:57:10,067 INFO L191 MainTranslator]: Completed pre-run [2020-06-21 23:57:10,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-21 23:57:10,160 INFO L195 MainTranslator]: Completed translation [2020-06-21 23:57:10,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10 WrapperNode [2020-06-21 23:57:10,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-21 23:57:10,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-21 23:57:10,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-21 23:57:10,162 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-21 23:57:10,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-21 23:57:10,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-21 23:57:10,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-21 23:57:10,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-21 23:57:10,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,207 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-21 23:57:10,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-21 23:57:10,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-21 23:57:10,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-21 23:57:10,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-21 23:57:10,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-21 23:57:10,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-21 23:57:10,412 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-21 23:57:10,413 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-21 23:57:10,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:57:10 BoogieIcfgContainer [2020-06-21 23:57:10,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-21 23:57:10,415 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-21 23:57:10,415 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-21 23:57:10,417 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-21 23:57:10,418 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:57:10" (1/1) ... [2020-06-21 23:57:10,432 INFO L313 BlockEncoder]: Initial Icfg 8 locations, 11 edges [2020-06-21 23:57:10,433 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-21 23:57:10,434 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-21 23:57:10,434 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-21 23:57:10,435 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-21 23:57:10,436 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-21 23:57:10,437 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-21 23:57:10,437 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-21 23:57:10,453 INFO L185 BlockEncoder]: Using Use SBE [2020-06-21 23:57:10,466 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-21 23:57:10,471 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-21 23:57:10,473 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 23:57:10,485 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-21 23:57:10,487 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-21 23:57:10,488 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-21 23:57:10,488 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-21 23:57:10,489 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-21 23:57:10,489 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-21 23:57:10,489 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 7 edges [2020-06-21 23:57:10,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 11:57:10 BasicIcfg [2020-06-21 23:57:10,490 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-21 23:57:10,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-21 23:57:10,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-21 23:57:10,494 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-21 23:57:10,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.06 11:57:09" (1/4) ... [2020-06-21 23:57:10,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354e3c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 11:57:10, skipping insertion in model container [2020-06-21 23:57:10,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (2/4) ... [2020-06-21 23:57:10,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354e3c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.06 11:57:10, skipping insertion in model container [2020-06-21 23:57:10,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:57:10" (3/4) ... [2020-06-21 23:57:10,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354e3c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 11:57:10, skipping insertion in model container [2020-06-21 23:57:10,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 11:57:10" (4/4) ... [2020-06-21 23:57:10,498 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 23:57:10,507 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-21 23:57:10,515 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-21 23:57:10,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-21 23:57:10,562 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 23:57:10,562 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-21 23:57:10,563 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-21 23:57:10,563 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 23:57:10,563 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 23:57:10,563 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 23:57:10,563 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-21 23:57:10,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 23:57:10,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-21 23:57:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-21 23:57:10,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-21 23:57:10,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-21 23:57:10,637 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-21 23:57:10,637 INFO L451 ceAbstractionStarter]: At program point L13-1(lines 9 18) the Hoare annotation is: true [2020-06-21 23:57:10,637 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 12) no Hoare annotation was computed. [2020-06-21 23:57:10,638 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 9 18) no Hoare annotation was computed. [2020-06-21 23:57:10,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 11:57:10 BasicIcfg [2020-06-21 23:57:10,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-21 23:57:10,646 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-21 23:57:10,646 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-21 23:57:10,650 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-21 23:57:10,650 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:57:10,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.06 11:57:09" (1/5) ... [2020-06-21 23:57:10,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27543137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 11:57:10, skipping insertion in model container [2020-06-21 23:57:10,651 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:57:10,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.06 11:57:10" (2/5) ... [2020-06-21 23:57:10,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27543137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.06 11:57:10, skipping insertion in model container [2020-06-21 23:57:10,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:57:10,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.06 11:57:10" (3/5) ... [2020-06-21 23:57:10,653 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27543137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 11:57:10, skipping insertion in model container [2020-06-21 23:57:10,653 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:57:10,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 21.06 11:57:10" (4/5) ... [2020-06-21 23:57:10,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27543137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 11:57:10, skipping insertion in model container [2020-06-21 23:57:10,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-21 23:57:10,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.06 11:57:10" (5/5) ... [2020-06-21 23:57:10,655 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-21 23:57:10,682 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-21 23:57:10,683 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-21 23:57:10,683 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-21 23:57:10,683 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-21 23:57:10,683 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-21 23:57:10,683 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-21 23:57:10,684 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-21 23:57:10,684 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-21 23:57:10,684 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-21 23:57:10,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-21 23:57:10,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 23:57:10,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:10,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:10,710 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-21 23:57:10,711 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 23:57:10,711 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-21 23:57:10,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-21 23:57:10,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 23:57:10,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:10,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:10,712 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-21 23:57:10,712 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 23:57:10,717 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 5#L13-1true [2020-06-21 23:57:10,718 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 3#L10true [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 6#L10-2true [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 5#L13-1true [2020-06-21 23:57:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times [2020-06-21 23:57:10,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:10,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:10,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:10,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:10,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:10,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:10,815 INFO L82 PathProgramCache]: Analyzing trace with hash 64827, now seen corresponding path program 1 times [2020-06-21 23:57:10,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:10,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:10,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:10,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:10,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:10,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1911869, now seen corresponding path program 1 times [2020-06-21 23:57:10,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:10,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:10,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:10,897 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:10,898 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:10,898 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:10,898 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:10,899 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:57:10,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:10,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:10,899 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:10,899 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-21 23:57:10,899 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:10,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:10,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:10,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:10,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:11,027 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:11,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:11,068 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:57:11,068 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:11,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:11,102 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:57:11,102 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:11,107 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,137 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:57:11,137 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:11,145 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:57:11,169 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:11,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:11,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:11,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:11,170 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:57:11,170 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:57:11,170 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:11,170 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:11,170 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-21 23:57:11,170 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:11,170 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:11,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,263 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:11,268 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:57:11,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:11,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:11,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:11,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:11,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:11,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 23:57:11,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 23:57:11,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:57:11,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:11,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:11,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:11,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:11,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:11,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 23:57:11,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 23:57:11,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:57:11,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:11,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:11,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:57:11,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:11,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:11,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:11,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:57:11,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:57:11,309 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:57:11,315 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:57:11,315 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 23:57:11,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:57:11,317 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:57:11,318 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:57:11,318 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-21 23:57:11,320 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:57:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:11,359 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 23:57:11,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:11,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 23:57:11,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:57:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:11,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 23:57:11,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:11,451 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-21 23:57:11,456 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-21 23:57:11,458 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. [2020-06-21 23:57:11,527 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 17 states and 32 transitions. Complement of second has 7 states. [2020-06-21 23:57:11,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-21 23:57:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-21 23:57:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-06-21 23:57:11,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 1 letters. Loop has 3 letters. [2020-06-21 23:57:11,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:11,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 3 letters. [2020-06-21 23:57:11,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:11,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 1 letters. Loop has 6 letters. [2020-06-21 23:57:11,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:11,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 32 transitions. [2020-06-21 23:57:11,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-06-21 23:57:11,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 24 transitions. [2020-06-21 23:57:11,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-21 23:57:11,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-21 23:57:11,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 24 transitions. [2020-06-21 23:57:11,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:57:11,549 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. [2020-06-21 23:57:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 24 transitions. [2020-06-21 23:57:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2020-06-21 23:57:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-21 23:57:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2020-06-21 23:57:11,579 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 16 transitions. [2020-06-21 23:57:11,579 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 16 transitions. [2020-06-21 23:57:11,579 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-21 23:57:11,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 16 transitions. [2020-06-21 23:57:11,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-21 23:57:11,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:11,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:11,581 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-21 23:57:11,581 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 23:57:11,581 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 77#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 72#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 73#L10-2 [2020-06-21 23:57:11,581 INFO L796 eck$LassoCheckResult]: Loop: 73#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 78#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 79#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 73#L10-2 [2020-06-21 23:57:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 61658, now seen corresponding path program 1 times [2020-06-21 23:57:11,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:11,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash 66477, now seen corresponding path program 2 times [2020-06-21 23:57:11,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:11,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:11,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1836890164, now seen corresponding path program 1 times [2020-06-21 23:57:11,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:11,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:11,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:11,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:11,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:11,628 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:11,628 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:11,628 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:11,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:11,628 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:57:11,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,629 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:11,629 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:11,629 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-21 23:57:11,629 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:11,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:11,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:11,685 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:11,690 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:11,717 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:57:11,717 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:11,727 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:11,756 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:57:11,756 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:11,762 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:11,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:57:11,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:11,849 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:57:11,853 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:11,853 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:11,854 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:11,854 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:11,854 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:57:11,854 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:57:11,854 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:11,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:11,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-21 23:57:11,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:11,855 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:11,913 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:11,913 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:57:11,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:11,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:11,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:11,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:11,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:11,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 23:57:11,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 23:57:11,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:57:11,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:11,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:11,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:11,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:11,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:11,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 23:57:11,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 23:57:11,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:57:11,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:11,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:11,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:57:11,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:11,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:11,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:11,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:57:11,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:57:11,942 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:57:11,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:57:11,947 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-21 23:57:11,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:57:11,948 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:57:11,948 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:57:11,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-21 23:57:11,948 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:57:11,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:11,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 23:57:11,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:11,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 23:57:11,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:57:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:12,016 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-21 23:57:12,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:12,073 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-21 23:57:12,074 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-21 23:57:12,074 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 16 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-06-21 23:57:12,241 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 16 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 31 states and 51 transitions. Complement of second has 20 states. [2020-06-21 23:57:12,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 3 accepting loop states [2020-06-21 23:57:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 23:57:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2020-06-21 23:57:12,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 3 letters. Loop has 3 letters. [2020-06-21 23:57:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 6 letters. Loop has 3 letters. [2020-06-21 23:57:12,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:12,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 3 letters. Loop has 6 letters. [2020-06-21 23:57:12,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:12,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2020-06-21 23:57:12,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-21 23:57:12,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 19 states and 34 transitions. [2020-06-21 23:57:12,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-06-21 23:57:12,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-21 23:57:12,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 34 transitions. [2020-06-21 23:57:12,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:57:12,250 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 34 transitions. [2020-06-21 23:57:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 34 transitions. [2020-06-21 23:57:12,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 7. [2020-06-21 23:57:12,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-21 23:57:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2020-06-21 23:57:12,252 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. [2020-06-21 23:57:12,252 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 12 transitions. [2020-06-21 23:57:12,252 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-21 23:57:12,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 12 transitions. [2020-06-21 23:57:12,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-21 23:57:12,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:12,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:12,253 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:57:12,254 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 23:57:12,254 INFO L794 eck$LassoCheckResult]: Stem: 193#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 194#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 189#L10 [2020-06-21 23:57:12,254 INFO L796 eck$LassoCheckResult]: Loop: 189#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 190#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 195#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 189#L10 [2020-06-21 23:57:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 1 times [2020-06-21 23:57:12,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:12,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,261 INFO L82 PathProgramCache]: Analyzing trace with hash 59803, now seen corresponding path program 1 times [2020-06-21 23:57:12,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:12,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,267 INFO L82 PathProgramCache]: Analyzing trace with hash 59254520, now seen corresponding path program 1 times [2020-06-21 23:57:12,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:12,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,299 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:12,300 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:12,300 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:12,300 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:12,300 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:57:12,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:12,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:12,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:12,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-21 23:57:12,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:12,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:12,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:12,348 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:12,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:12,351 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:12,382 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:57:12,383 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:12,387 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:57:12,413 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:12,413 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:12,413 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:12,413 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:12,413 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:57:12,413 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:57:12,413 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:12,414 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:12,414 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-21 23:57:12,414 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:12,414 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:12,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:12,466 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:57:12,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:12,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:12,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:57:12,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:12,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:12,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:12,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:57:12,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:57:12,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:57:12,477 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:57:12,477 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 23:57:12,477 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:57:12,477 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:57:12,478 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:57:12,478 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2020-06-21 23:57:12,478 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:57:12,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:12,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 23:57:12,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:12,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-21 23:57:12,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:57:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:12,550 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-21 23:57:12,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:12,552 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-21 23:57:12,552 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-21 23:57:12,552 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-06-21 23:57:12,691 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 7 states and 12 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 63 states and 97 transitions. Complement of second has 50 states. [2020-06-21 23:57:12,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 4 non-accepting loop states 2 accepting loop states [2020-06-21 23:57:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-21 23:57:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-06-21 23:57:12,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 2 letters. Loop has 3 letters. [2020-06-21 23:57:12,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:12,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2020-06-21 23:57:12,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:12,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-21 23:57:12,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:12,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 97 transitions. [2020-06-21 23:57:12,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-21 23:57:12,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 17 states and 29 transitions. [2020-06-21 23:57:12,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 23:57:12,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-21 23:57:12,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 29 transitions. [2020-06-21 23:57:12,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:57:12,700 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 29 transitions. [2020-06-21 23:57:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 29 transitions. [2020-06-21 23:57:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 9. [2020-06-21 23:57:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-21 23:57:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-21 23:57:12,702 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-21 23:57:12,702 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-21 23:57:12,702 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-21 23:57:12,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-06-21 23:57:12,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-21 23:57:12,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:12,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:12,703 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:57:12,703 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-06-21 23:57:12,703 INFO L794 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 364#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 359#L10 [2020-06-21 23:57:12,704 INFO L796 eck$LassoCheckResult]: Loop: 359#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 360#L10-2 [43] L10-2-->L13-1: Formula: (and (> v_ULTIMATE.start_main_~i~0_9 30) (= v_ULTIMATE.start_main_~i~0_8 20)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 367#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 359#L10 [2020-06-21 23:57:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 2 times [2020-06-21 23:57:12,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,709 INFO L82 PathProgramCache]: Analyzing trace with hash 59989, now seen corresponding path program 1 times [2020-06-21 23:57:12,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:12,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:57:12,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-21 23:57:12,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-21 23:57:12,748 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-21 23:57:12,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-21 23:57:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-21 23:57:12,752 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-06-21 23:57:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-21 23:57:12,770 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-06-21 23:57:12,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-21 23:57:12,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2020-06-21 23:57:12,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-21 23:57:12,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2020-06-21 23:57:12,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 23:57:12,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-21 23:57:12,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-06-21 23:57:12,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:57:12,773 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-06-21 23:57:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-06-21 23:57:12,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-06-21 23:57:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-21 23:57:12,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-06-21 23:57:12,775 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-21 23:57:12,775 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-21 23:57:12,775 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-21 23:57:12,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-06-21 23:57:12,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-21 23:57:12,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:12,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:12,776 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:57:12,777 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2020-06-21 23:57:12,777 INFO L794 eck$LassoCheckResult]: Stem: 390#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 391#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 386#L10 [2020-06-21 23:57:12,777 INFO L796 eck$LassoCheckResult]: Loop: 386#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 387#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 393#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 388#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 389#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 394#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 386#L10 [2020-06-21 23:57:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 3 times [2020-06-21 23:57:12,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1781634639, now seen corresponding path program 1 times [2020-06-21 23:57:12,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:12,790 INFO L82 PathProgramCache]: Analyzing trace with hash 19890130, now seen corresponding path program 2 times [2020-06-21 23:57:12,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-21 23:57:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:12,822 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:12,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:12,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:12,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:12,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:57:12,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:12,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:12,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:12,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-21 23:57:12,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:12,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:12,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,871 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:12,871 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:12,874 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:12,875 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:12,902 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:57:12,902 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:12,906 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:12,907 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:12,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:57:12,938 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:12,942 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:57:12,966 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:12,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:12,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:12,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:12,966 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:57:12,966 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:57:12,966 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:12,967 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:12,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-21 23:57:12,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:12,967 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:12,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:12,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:13,012 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:13,012 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:57:13,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:13,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:13,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:57:13,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:13,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:13,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:13,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:57:13,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:57:13,018 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:57:13,021 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:57:13,021 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 23:57:13,022 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:57:13,022 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:57:13,022 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:57:13,022 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 53 Supporting invariants [] [2020-06-21 23:57:13,022 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:57:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:57:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:13,307 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-21 23:57:13,307 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-06-21 23:57:13,307 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-21 23:57:13,624 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 11 states and 16 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 148 states and 190 transitions. Complement of second has 120 states. [2020-06-21 23:57:13,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 7 non-accepting loop states 2 accepting loop states [2020-06-21 23:57:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-21 23:57:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2020-06-21 23:57:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 2 letters. Loop has 6 letters. [2020-06-21 23:57:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:13,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 8 letters. Loop has 6 letters. [2020-06-21 23:57:13,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:13,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 41 transitions. Stem has 2 letters. Loop has 12 letters. [2020-06-21 23:57:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:13,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 190 transitions. [2020-06-21 23:57:13,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-21 23:57:13,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 36 states and 52 transitions. [2020-06-21 23:57:13,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-21 23:57:13,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-21 23:57:13,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 52 transitions. [2020-06-21 23:57:13,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:57:13,638 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 52 transitions. [2020-06-21 23:57:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 52 transitions. [2020-06-21 23:57:13,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2020-06-21 23:57:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-21 23:57:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-06-21 23:57:13,641 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-21 23:57:13,641 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-21 23:57:13,641 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-21 23:57:13,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2020-06-21 23:57:13,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-21 23:57:13,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:13,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:13,642 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:57:13,642 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2020-06-21 23:57:13,642 INFO L794 eck$LassoCheckResult]: Stem: 793#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 794#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 789#L10 [2020-06-21 23:57:13,643 INFO L796 eck$LassoCheckResult]: Loop: 789#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 790#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 805#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 803#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 800#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 796#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 797#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 802#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 804#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 789#L10 [2020-06-21 23:57:13,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:13,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 4 times [2020-06-21 23:57:13,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:13,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:13,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:13,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:13,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:13,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:13,648 INFO L82 PathProgramCache]: Analyzing trace with hash -528270053, now seen corresponding path program 2 times [2020-06-21 23:57:13,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:13,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:13,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:13,657 INFO L82 PathProgramCache]: Analyzing trace with hash -158580552, now seen corresponding path program 3 times [2020-06-21 23:57:13,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:13,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:13,705 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:13,705 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:13,705 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:13,705 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:13,706 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:57:13,706 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:13,706 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:13,706 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:13,706 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-21 23:57:13,706 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:13,706 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:13,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:13,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:13,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:13,747 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:13,747 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:13,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:13,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:13,783 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:57:13,783 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:13,787 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:13,787 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:13,814 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-21 23:57:13,815 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:13,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:13,820 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:13,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:57:13,851 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:13,857 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:57:13,881 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:13,881 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:13,881 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:13,881 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:13,882 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:57:13,882 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:57:13,882 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:13,882 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:13,882 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Loop [2020-06-21 23:57:13,882 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:13,882 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:13,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:13,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:13,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:13,926 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:13,926 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:57:13,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:13,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:13,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:13,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:13,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:13,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-21 23:57:13,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-21 23:57:13,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-21 23:57:13,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:13,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:13,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:57:13,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:13,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:13,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:13,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:57:13,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:57:13,937 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:57:13,939 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:57:13,939 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 23:57:13,940 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:57:13,940 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:57:13,940 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:57:13,940 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] [2020-06-21 23:57:13,940 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:57:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:13,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:57:13,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:57:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,051 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,055 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,060 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:14,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:57:14,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:14,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:57:14,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:14,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:57:14,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:14,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-21 23:57:14,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,159 INFO L98 LoopCannibalizer]: 6 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-21 23:57:14,159 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-06-21 23:57:14,160 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-06-21 23:57:14,370 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 26 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 250 states and 306 transitions. Complement of second has 152 states. [2020-06-21 23:57:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 8 non-accepting loop states 2 accepting loop states [2020-06-21 23:57:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-06-21 23:57:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2020-06-21 23:57:14,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 2 letters. Loop has 9 letters. [2020-06-21 23:57:14,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:14,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 11 letters. Loop has 9 letters. [2020-06-21 23:57:14,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:14,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 44 transitions. Stem has 2 letters. Loop has 18 letters. [2020-06-21 23:57:14,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:14,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250 states and 306 transitions. [2020-06-21 23:57:14,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2020-06-21 23:57:14,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250 states to 38 states and 54 transitions. [2020-06-21 23:57:14,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-21 23:57:14,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-06-21 23:57:14,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 54 transitions. [2020-06-21 23:57:14,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:57:14,383 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 54 transitions. [2020-06-21 23:57:14,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 54 transitions. [2020-06-21 23:57:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 20. [2020-06-21 23:57:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-21 23:57:14,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-06-21 23:57:14,386 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-06-21 23:57:14,386 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-06-21 23:57:14,386 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-21 23:57:14,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-06-21 23:57:14,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-06-21 23:57:14,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:14,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:14,387 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:57:14,387 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2020-06-21 23:57:14,387 INFO L794 eck$LassoCheckResult]: Stem: 1384#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1385#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1380#L10 [2020-06-21 23:57:14,388 INFO L796 eck$LassoCheckResult]: Loop: 1380#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1381#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1387#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1388#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1398#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1399#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1382#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1383#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1393#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1395#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1394#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1397#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1380#L10 [2020-06-21 23:57:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:14,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 5 times [2020-06-21 23:57:14,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:14,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:14,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:14,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:14,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:14,393 INFO L82 PathProgramCache]: Analyzing trace with hash -932932913, now seen corresponding path program 3 times [2020-06-21 23:57:14,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:14,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:14,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:14,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 190844434, now seen corresponding path program 4 times [2020-06-21 23:57:14,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:14,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:14,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:14,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,453 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:14,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:14,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:14,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:14,453 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-21 23:57:14,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:14,453 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:14,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:14,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-21 23:57:14,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:14,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:14,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:14,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:14,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:14,500 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:14,500 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:14,506 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-21 23:57:14,506 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-21 23:57:14,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-21 23:57:14,537 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-21 23:57:14,541 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-21 23:57:14,564 INFO L216 LassoAnalysis]: Preferences: [2020-06-21 23:57:14,565 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-21 23:57:14,565 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-21 23:57:14,565 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-21 23:57:14,565 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-21 23:57:14,565 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-21 23:57:14,565 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-21 23:57:14,565 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-21 23:57:14,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Loop [2020-06-21 23:57:14,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-21 23:57:14,566 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-21 23:57:14,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:14,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:14,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-21 23:57:14,602 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-21 23:57:14,603 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-21 23:57:14,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-21 23:57:14,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-21 23:57:14,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-21 23:57:14,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-21 23:57:14,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-21 23:57:14,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-21 23:57:14,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-21 23:57:14,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-21 23:57:14,608 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-21 23:57:14,610 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-21 23:57:14,610 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-21 23:57:14,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-21 23:57:14,610 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-21 23:57:14,610 INFO L518 LassoAnalysis]: Proved termination. [2020-06-21 23:57:14,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2020-06-21 23:57:14,611 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-21 23:57:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:14,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-21 23:57:14,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:14,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-21 23:57:14,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-21 23:57:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,812 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,817 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,823 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,834 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,839 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,845 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,851 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,856 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:14,861 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-21 23:57:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-21 23:57:14,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-21 23:57:14,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-21 23:57:14,889 INFO L98 LoopCannibalizer]: 7 predicates before loop cannibalization 7 predicates after loop cannibalization [2020-06-21 23:57:14,890 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2020-06-21 23:57:14,890 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 29 transitions. cyclomatic complexity: 10 Second operand 7 states. [2020-06-21 23:57:15,114 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 29 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 151 states and 183 transitions. Complement of second has 98 states. [2020-06-21 23:57:15,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 7 non-accepting loop states 3 accepting loop states [2020-06-21 23:57:15,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-06-21 23:57:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2020-06-21 23:57:15,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 2 letters. Loop has 12 letters. [2020-06-21 23:57:15,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:15,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 14 letters. Loop has 12 letters. [2020-06-21 23:57:15,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:15,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 36 transitions. Stem has 2 letters. Loop has 24 letters. [2020-06-21 23:57:15,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-21 23:57:15,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 183 transitions. [2020-06-21 23:57:15,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2020-06-21 23:57:15,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 34 states and 47 transitions. [2020-06-21 23:57:15,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-06-21 23:57:15,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-06-21 23:57:15,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2020-06-21 23:57:15,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-21 23:57:15,121 INFO L706 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2020-06-21 23:57:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2020-06-21 23:57:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2020-06-21 23:57:15,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-21 23:57:15,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2020-06-21 23:57:15,124 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-06-21 23:57:15,124 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-06-21 23:57:15,124 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-21 23:57:15,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2020-06-21 23:57:15,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2020-06-21 23:57:15,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-21 23:57:15,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-21 23:57:15,125 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-06-21 23:57:15,125 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2020-06-21 23:57:15,126 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY [32] ULTIMATE.startENTRY-->L13-1: Formula: (= v_ULTIMATE.start_main_~i~0_1 |v_ULTIMATE.start_main_#t~nondet0_4|) InVars {} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_1|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|} AuxVars[|v_ULTIMATE.start_main_#t~nondet0_4|] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~i~0] 1772#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1767#L10 [2020-06-21 23:57:15,126 INFO L796 eck$LassoCheckResult]: Loop: 1767#L10 [30] L10-->L10-2: Formula: (and (= 25 v_ULTIMATE.start_main_~i~0_13) (= v_ULTIMATE.start_main_~i~0_12 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1768#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1774#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1775#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1776#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1777#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1789#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1788#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1787#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1769#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1770#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1782#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1784#L10 [44] L10-->L10-2: Formula: (< 25 v_ULTIMATE.start_main_~i~0_14) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14} AuxVars[] AssignedVars[] 1783#L10-2 [37] L10-2-->L13-1: Formula: (and (= v_ULTIMATE.start_main_~i~0_6 (+ v_ULTIMATE.start_main_~i~0_7 (- 1))) (<= v_ULTIMATE.start_main_~i~0_7 30)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_7} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 1786#L13-1 [35] L13-1-->L10: Formula: (< 10 v_ULTIMATE.start_main_~i~0_11) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11} AuxVars[] AssignedVars[] 1767#L10 [2020-06-21 23:57:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1988, now seen corresponding path program 6 times [2020-06-21 23:57:15,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:15,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:15,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:15,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:15,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:15,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:15,131 INFO L82 PathProgramCache]: Analyzing trace with hash -270995301, now seen corresponding path program 4 times [2020-06-21 23:57:15,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:15,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:15,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:15,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:15,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:15,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-21 23:57:15,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1090123144, now seen corresponding path program 5 times [2020-06-21 23:57:15,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-21 23:57:15,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-21 23:57:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:15,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-21 23:57:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-21 23:57:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-21 23:57:15,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.06 11:57:15 BasicIcfg [2020-06-21 23:57:15,232 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-21 23:57:15,232 INFO L168 Benchmark]: Toolchain (without parser) took 5359.74 ms. Allocated memory was 649.6 MB in the beginning and 772.8 MB in the end (delta: 123.2 MB). Free memory was 565.0 MB in the beginning and 619.9 MB in the end (delta: -54.9 MB). Peak memory consumption was 68.3 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,234 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-21 23:57:15,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.90 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 565.0 MB in the beginning and 648.5 MB in the end (delta: -83.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.93 ms. Allocated memory is still 683.7 MB. Free memory was 647.4 MB in the beginning and 646.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,236 INFO L168 Benchmark]: Boogie Preprocessor took 18.93 ms. Allocated memory is still 683.7 MB. Free memory was 646.3 MB in the beginning and 645.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,236 INFO L168 Benchmark]: RCFGBuilder took 200.18 ms. Allocated memory is still 683.7 MB. Free memory was 645.3 MB in the beginning and 631.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,237 INFO L168 Benchmark]: BlockEncodingV2 took 75.19 ms. Allocated memory is still 683.7 MB. Free memory was 631.8 MB in the beginning and 627.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,237 INFO L168 Benchmark]: TraceAbstraction took 155.05 ms. Allocated memory is still 683.7 MB. Free memory was 626.3 MB in the beginning and 617.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,238 INFO L168 Benchmark]: BuchiAutomizer took 4585.53 ms. Allocated memory was 683.7 MB in the beginning and 772.8 MB in the end (delta: 89.1 MB). Free memory was 617.7 MB in the beginning and 619.9 MB in the end (delta: -2.2 MB). Peak memory consumption was 86.9 MB. Max. memory is 50.3 GB. [2020-06-21 23:57:15,243 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 8 locations, 11 edges - StatisticsResult: Encoded RCFG 4 locations, 7 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 286.90 ms. Allocated memory was 649.6 MB in the beginning and 683.7 MB in the end (delta: 34.1 MB). Free memory was 565.0 MB in the beginning and 648.5 MB in the end (delta: -83.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 32.93 ms. Allocated memory is still 683.7 MB. Free memory was 647.4 MB in the beginning and 646.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 18.93 ms. Allocated memory is still 683.7 MB. Free memory was 646.3 MB in the beginning and 645.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 200.18 ms. Allocated memory is still 683.7 MB. Free memory was 645.3 MB in the beginning and 631.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 75.19 ms. Allocated memory is still 683.7 MB. Free memory was 631.8 MB in the beginning and 627.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 155.05 ms. Allocated memory is still 683.7 MB. Free memory was 626.3 MB in the beginning and 617.7 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4585.53 ms. Allocated memory was 683.7 MB in the beginning and 772.8 MB in the end (delta: 89.1 MB). Free memory was 617.7 MB in the beginning and 619.9 MB in the end (delta: -2.2 MB). Peak memory consumption was 86.9 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - AllSpecificationsHoldResult: All specifications hold We were not able to verify any specifiation because the program does not contain any specification. - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 4 locations, 0 error locations. SAFE Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 1 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 0 deterministic, 6 nondeterministic) and one nonterminating remainder module.One nondeterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + 27 and consists of 8 locations. One nondeterministic module has affine ranking function -2 * i + 53 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * i + 26 and consists of 12 locations. One nondeterministic module has affine ranking function -2 * i + 51 and consists of 12 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 2.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 73 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 7. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6/30 HoareTripleCheckerStatistics: 31 SDtfs, 113 SDslu, 0 SDs, 0 SdLazy, 407 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT6 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax230 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq182 hnf89 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 10]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@53afd588=0, \result=0, i=25} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 Loop: [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-21 23:57:06.670 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-21 23:57:15.479 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check