YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:15:56,376 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:15:56,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:15:56,389 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:15:56,389 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:15:56,390 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:15:56,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:15:56,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:15:56,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:15:56,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:15:56,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:15:56,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:15:56,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:15:56,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:15:56,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:15:56,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:15:56,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:15:56,402 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:15:56,404 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:15:56,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:15:56,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:15:56,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:15:56,409 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:15:56,409 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:15:56,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:15:56,410 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:15:56,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:15:56,411 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:15:56,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:15:56,412 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:15:56,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:15:56,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:15:56,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:15:56,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:15:56,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:15:56,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:15:56,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:15:56,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:15:56,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:15:56,418 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 05:15:56,432 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:15:56,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:15:56,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:15:56,434 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:15:56,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:15:56,434 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:15:56,434 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:15:56,434 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:15:56,435 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:15:56,435 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:15:56,435 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:15:56,435 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:15:56,435 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:15:56,436 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:15:56,436 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:15:56,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:15:56,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:15:56,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:15:56,436 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:15:56,437 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:15:56,437 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:15:56,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:15:56,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:15:56,437 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:15:56,437 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:15:56,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:15:56,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:15:56,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:15:56,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:15:56,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:15:56,476 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:15:56,479 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:15:56,481 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:15:56,481 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:15:56,482 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:15:56,547 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/70e89b095c19476bb3a6474774343596/FLAG5be56d7b3 [2020-06-22 05:15:56,876 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:15:56,876 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:15:56,883 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/70e89b095c19476bb3a6474774343596/FLAG5be56d7b3 [2020-06-22 05:15:57,281 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/70e89b095c19476bb3a6474774343596 [2020-06-22 05:15:57,292 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:15:57,293 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:15:57,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:15:57,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:15:57,298 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:15:57,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cd18b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57, skipping insertion in model container [2020-06-22 05:15:57,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:15:57,328 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:15:57,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:15:57,489 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:15:57,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:15:57,580 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:15:57,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57 WrapperNode [2020-06-22 05:15:57,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:15:57,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:15:57,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:15:57,582 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:15:57,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:15:57,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:15:57,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:15:57,619 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:15:57,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:15:57,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:15:57,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:15:57,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:15:57,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (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-22 05:15:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:15:57,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:15:57,867 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:15:57,867 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 05:15:57,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:15:57 BoogieIcfgContainer [2020-06-22 05:15:57,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:15:57,869 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:15:57,870 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:15:57,872 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:15:57,873 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:15:57" (1/1) ... [2020-06-22 05:15:57,890 INFO L313 BlockEncoder]: Initial Icfg 11 locations, 17 edges [2020-06-22 05:15:57,892 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:15:57,893 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:15:57,894 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:15:57,894 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:15:57,896 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:15:57,897 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:15:57,897 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:15:57,914 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:15:57,929 INFO L200 BlockEncoder]: SBE split 1 edges [2020-06-22 05:15:57,934 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-06-22 05:15:57,935 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:15:57,948 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding [2020-06-22 05:15:57,950 INFO L70 RemoveSinkStates]: Removed 5 edges and 2 locations by removing sink states [2020-06-22 05:15:57,952 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:15:57,952 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:15:57,956 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 05:15:57,957 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:15:57,957 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:15:57,957 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:15:57,957 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:15:57,958 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:15:57,958 INFO L313 BlockEncoder]: Encoded RCFG 4 locations, 6 edges [2020-06-22 05:15:57,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:15:57 BasicIcfg [2020-06-22 05:15:57,959 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:15:57,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:15:57,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:15:57,964 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:15:57,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:15:57" (1/4) ... [2020-06-22 05:15:57,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587bb74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:15:57, skipping insertion in model container [2020-06-22 05:15:57,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (2/4) ... [2020-06-22 05:15:57,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587bb74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:15:57, skipping insertion in model container [2020-06-22 05:15:57,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:15:57" (3/4) ... [2020-06-22 05:15:57,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587bb74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:15:57, skipping insertion in model container [2020-06-22 05:15:57,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:15:57" (4/4) ... [2020-06-22 05:15:57,967 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:15:57,977 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:15:57,985 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 0 error locations. [2020-06-22 05:15:58,005 INFO L257 AbstractCegarLoop]: Starting to check reachability of 0 error locations. [2020-06-22 05:15:58,034 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:15:58,035 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:15:58,035 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:15:58,035 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:15:58,036 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:15:58,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:15:58,036 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:15:58,036 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:15:58,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:15:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-06-22 05:15:58,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:15:58,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-06-22 05:15:58,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:15:58,112 INFO L451 ceAbstractionStarter]: At program point L25-2(lines 25 26) the Hoare annotation is: true [2020-06-22 05:15:58,112 INFO L451 ceAbstractionStarter]: At program point L22-2(lines 22 28) the Hoare annotation is: true [2020-06-22 05:15:58,112 INFO L451 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: true [2020-06-22 05:15:58,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:15:58 BasicIcfg [2020-06-22 05:15:58,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:15:58,121 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:15:58,122 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:15:58,125 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:15:58,126 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:15:58,126 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:15:57" (1/5) ... [2020-06-22 05:15:58,127 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ed1c508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:15:58, skipping insertion in model container [2020-06-22 05:15:58,127 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:15:58,127 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:15:57" (2/5) ... [2020-06-22 05:15:58,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ed1c508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:15:58, skipping insertion in model container [2020-06-22 05:15:58,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:15:58,128 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:15:57" (3/5) ... [2020-06-22 05:15:58,128 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ed1c508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:15:58, skipping insertion in model container [2020-06-22 05:15:58,128 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:15:58,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:15:57" (4/5) ... [2020-06-22 05:15:58,129 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ed1c508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:15:58, skipping insertion in model container [2020-06-22 05:15:58,129 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:15:58,129 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:15:58" (5/5) ... [2020-06-22 05:15:58,131 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:15:58,159 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:15:58,159 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:15:58,159 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:15:58,159 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:15:58,159 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:15:58,160 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:15:58,160 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:15:58,160 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:15:58,160 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:15:58,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 05:15:58,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 05:15:58,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:15:58,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:15:58,186 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 05:15:58,186 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 05:15:58,186 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:15:58,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-06-22 05:15:58,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 05:15:58,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:15:58,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:15:58,188 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-06-22 05:15:58,188 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 05:15:58,193 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 5#L20-2true [2020-06-22 05:15:58,193 INFO L796 eck$LassoCheckResult]: Loop: 5#L20-2true [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 6#L22-2true [75] L22-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11) (<= v_ULTIMATE.start_main_~m~0_8 v_ULTIMATE.start_main_~j~0_8)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6] 5#L20-2true [2020-06-22 05:15:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:58,199 INFO L82 PathProgramCache]: Analyzing trace with hash 109, now seen corresponding path program 1 times [2020-06-22 05:15:58,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:58,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:58,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2927, now seen corresponding path program 1 times [2020-06-22 05:15:58,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:58,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:58,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:58,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:58,283 INFO L82 PathProgramCache]: Analyzing trace with hash 106715, now seen corresponding path program 1 times [2020-06-22 05:15:58,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:58,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:58,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:58,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,343 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:15:58,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:15:58,344 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:15:58,344 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:15:58,345 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:15:58,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:15:58,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:15:58,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:15:58,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:15:58,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:15:58,346 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:15:58,364 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-22 05:15:58,378 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-22 05:15:58,381 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-22 05:15:58,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:15:58,450 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-22 05:15:58,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:15:58,457 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-22 05:15:58,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:15:58,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:15:58,649 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:15:58,652 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:15:58,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:15:58,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:15:58,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:15:58,652 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:15:58,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:15:58,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:15:58,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:15:58,653 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Loop [2020-06-22 05:15:58,653 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:15:58,653 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:15:58,655 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-22 05:15:58,663 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-22 05:15:58,678 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-22 05:15:58,734 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:15:58,740 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:15:58,742 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-22 05:15:58,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:15:58,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:15:58,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:15:58,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:15:58,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:15:58,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:15:58,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:15:58,756 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:15:58,765 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:15:58,765 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:15:58,768 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:15:58,768 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:15:58,769 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:15:58,769 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-06-22 05:15:58,771 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:15:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:15:58,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:15:58,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:15:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:15:58,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:15:58,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:15:58,844 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-22 05:15:58,869 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 05:15:58,874 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 2 loop predicates [2020-06-22 05:15:58,876 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 4 states. Second operand 3 states. [2020-06-22 05:15:58,907 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 4 states.. Second operand 3 states. Result 10 states and 16 transitions. Complement of second has 4 states. [2020-06-22 05:15:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 05:15:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 05:15:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-06-22 05:15:58,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2020-06-22 05:15:58,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:58,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 05:15:58,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:58,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2020-06-22 05:15:58,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:58,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 16 transitions. [2020-06-22 05:15:58,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-06-22 05:15:58,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 14 transitions. [2020-06-22 05:15:58,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 05:15:58,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 05:15:58,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 14 transitions. [2020-06-22 05:15:58,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:15:58,927 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 05:15:58,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 14 transitions. [2020-06-22 05:15:58,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2020-06-22 05:15:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-06-22 05:15:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2020-06-22 05:15:58,955 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 05:15:58,955 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2020-06-22 05:15:58,955 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:15:58,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2020-06-22 05:15:58,956 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-06-22 05:15:58,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:15:58,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:15:58,957 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 05:15:58,957 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-06-22 05:15:58,957 INFO L794 eck$LassoCheckResult]: Stem: 47#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 48#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 54#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 49#L25-2 [2020-06-22 05:15:58,958 INFO L796 eck$LassoCheckResult]: Loop: 49#L25-2 [56] L25-2-->L25-2: Formula: (and (< v_ULTIMATE.start_main_~k~0_8 v_ULTIMATE.start_main_~N~0_7) (= v_ULTIMATE.start_main_~k~0_7 (+ v_ULTIMATE.start_main_~k~0_8 1))) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_8, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_7, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0] 49#L25-2 [2020-06-22 05:15:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:58,958 INFO L82 PathProgramCache]: Analyzing trace with hash 106706, now seen corresponding path program 1 times [2020-06-22 05:15:58,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:58,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:58,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 1 times [2020-06-22 05:15:58,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:58,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:58,974 INFO L82 PathProgramCache]: Analyzing trace with hash 3307942, now seen corresponding path program 1 times [2020-06-22 05:15:58,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:58,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:58,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:58,998 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:15:58,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:15:58,999 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:15:58,999 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:15:58,999 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:15:58,999 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:15:58,999 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:15:58,999 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:15:58,999 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:15:59,000 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:15:59,000 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:15:59,001 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-22 05:15:59,031 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:15:59,031 INFO L412 LassoAnalysis]: Checking for nontermination... 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-22 05:15:59,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:15:59,035 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-22 05:15:59,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:15:59,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:15:59,256 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:15:59,259 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:15:59,272 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:15:59,273 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:15:59,273 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:15:59,273 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:15:59,273 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:15:59,273 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:15:59,273 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:15:59,273 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Loop [2020-06-22 05:15:59,273 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:15:59,274 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:15:59,275 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-22 05:15:59,302 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:15:59,302 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:15:59,302 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-22 05:15:59,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:15:59,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:15:59,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:15:59,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:15:59,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:15:59,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:15:59,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:15:59,312 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:15:59,318 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:15:59,318 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:15:59,319 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:15:59,319 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:15:59,319 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:15:59,319 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2020-06-22 05:15:59,320 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:15:59,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:15:59,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:15:59,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:15:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:15:59,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:15:59,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:15:59,344 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-22 05:15:59,345 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 05:15:59,345 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 1 loop predicates [2020-06-22 05:15:59,345 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 2 states. [2020-06-22 05:15:59,356 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 2 states. Result 12 states and 20 transitions. Complement of second has 4 states. [2020-06-22 05:15:59,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 05:15:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-06-22 05:15:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-06-22 05:15:59,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 1 letters. [2020-06-22 05:15:59,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:59,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 4 letters. Loop has 1 letters. [2020-06-22 05:15:59,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:59,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 05:15:59,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:59,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 20 transitions. [2020-06-22 05:15:59,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 05:15:59,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 10 states and 16 transitions. [2020-06-22 05:15:59,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-06-22 05:15:59,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-06-22 05:15:59,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 16 transitions. [2020-06-22 05:15:59,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:15:59,361 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-06-22 05:15:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 16 transitions. [2020-06-22 05:15:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2020-06-22 05:15:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-06-22 05:15:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-06-22 05:15:59,363 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 05:15:59,363 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-06-22 05:15:59,363 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 05:15:59,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 14 transitions. [2020-06-22 05:15:59,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:15:59,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:15:59,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:15:59,364 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 05:15:59,365 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 05:15:59,365 INFO L794 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 99#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 106#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 100#L25-2 [2020-06-22 05:15:59,365 INFO L796 eck$LassoCheckResult]: Loop: 100#L25-2 [77] L25-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_8 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 102#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 100#L25-2 [2020-06-22 05:15:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash 106706, now seen corresponding path program 2 times [2020-06-22 05:15:59,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash 3414, now seen corresponding path program 1 times [2020-06-22 05:15:59,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:59,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:15:59,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,385 INFO L82 PathProgramCache]: Analyzing trace with hash 102546919, now seen corresponding path program 1 times [2020-06-22 05:15:59,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:59,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:59,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,428 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:15:59,429 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:15:59,429 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:15:59,429 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:15:59,429 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:15:59,429 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:15:59,429 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:15:59,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:15:59,430 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:15:59,430 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:15:59,430 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:15:59,431 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-22 05:15:59,445 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-22 05:15:59,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:15:59,505 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-22 05:15:59,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:15:59,510 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-22 05:15:59,546 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:15:59,546 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:15:59,731 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:15:59,733 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:15:59,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:15:59,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:15:59,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:15:59,734 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:15:59,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:15:59,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:15:59,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:15:59,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Loop [2020-06-22 05:15:59,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:15:59,734 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:15:59,736 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-22 05:15:59,743 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-22 05:15:59,785 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:15:59,785 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:15:59,785 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-22 05:15:59,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:15:59,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:15:59,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:15:59,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:15:59,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:15:59,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:15:59,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:15:59,792 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:15:59,797 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:15:59,797 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:15:59,798 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:15:59,798 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:15:59,798 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:15:59,798 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2020-06-22 05:15:59,799 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:15:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:15:59,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:15:59,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:15:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:15:59,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:15:59,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:15:59,837 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-22 05:15:59,838 INFO L98 LoopCannibalizer]: 1 predicates before loop cannibalization 1 predicates after loop cannibalization [2020-06-22 05:15:59,838 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 1 loop predicates [2020-06-22 05:15:59,838 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 05:15:59,851 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 9 states and 14 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 17 states and 29 transitions. Complement of second has 4 states. [2020-06-22 05:15:59,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 05:15:59,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 05:15:59,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-06-22 05:15:59,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 2 letters. [2020-06-22 05:15:59,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:59,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 5 letters. Loop has 2 letters. [2020-06-22 05:15:59,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:59,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 05:15:59,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:15:59,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 29 transitions. [2020-06-22 05:15:59,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 05:15:59,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 28 transitions. [2020-06-22 05:15:59,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-06-22 05:15:59,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-06-22 05:15:59,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 28 transitions. [2020-06-22 05:15:59,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:15:59,859 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 28 transitions. [2020-06-22 05:15:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 28 transitions. [2020-06-22 05:15:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2020-06-22 05:15:59,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 05:15:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2020-06-22 05:15:59,861 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. [2020-06-22 05:15:59,861 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 24 transitions. [2020-06-22 05:15:59,861 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 05:15:59,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 24 transitions. [2020-06-22 05:15:59,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 05:15:59,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:15:59,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:15:59,862 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 05:15:59,862 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:15:59,863 INFO L794 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 159#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 169#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 160#L25-2 [2020-06-22 05:15:59,865 INFO L796 eck$LassoCheckResult]: Loop: 160#L25-2 [77] L25-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_8 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 164#L22-2 [75] L22-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11) (<= v_ULTIMATE.start_main_~m~0_8 v_ULTIMATE.start_main_~j~0_8)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6] 165#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 166#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 160#L25-2 [2020-06-22 05:15:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash 106706, now seen corresponding path program 3 times [2020-06-22 05:15:59,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:59,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,875 INFO L82 PathProgramCache]: Analyzing trace with hash 3291460, now seen corresponding path program 1 times [2020-06-22 05:15:59,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:59,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:15:59,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:15:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash -236648043, now seen corresponding path program 1 times [2020-06-22 05:15:59,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:15:59,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:15:59,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:15:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:15:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:15:59,935 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:15:59,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:15:59,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:15:59,935 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:15:59,936 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:15:59,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:15:59,936 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:15:59,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:15:59,936 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:15:59,937 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:15:59,937 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:15:59,938 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-22 05:15:59,951 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-22 05:15:59,953 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-22 05:16:00,008 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:16:00,009 INFO L412 LassoAnalysis]: Checking for nontermination... 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-22 05:16:00,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:16:00,013 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-22 05:16:00,047 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:16:00,048 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:16:12,085 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-06-22 05:16:12,090 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:16:12,100 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:16:12,100 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:16:12,100 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:16:12,101 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:16:12,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:16:12,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:16:12,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:16:12,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Loop [2020-06-22 05:16:12,102 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:16:12,102 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:16:12,103 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-22 05:16:12,105 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-22 05:16:12,115 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-22 05:16:12,168 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:16:12,169 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:16:12,169 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-22 05:16:12,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:16:12,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:16:12,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:16:12,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:16:12,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:16:12,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:16:12,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:16:12,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:16:12,172 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-22 05:16:12,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:16:12,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:16:12,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:16:12,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:16:12,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:16:12,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:16:12,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:16:12,180 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:16:12,185 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:16:12,185 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:16:12,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:16:12,186 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:16:12,186 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:16:12,186 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~k~0 Supporting invariants [] [2020-06-22 05:16:12,186 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:16:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:16:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:16:12,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:16:12,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:16:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:16:12,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 05:16:12,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:16:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:16:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:16:12,267 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:16:12,268 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 05:16:12,268 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-22 05:16:12,268 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13 Second operand 5 states. [2020-06-22 05:16:12,439 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 24 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 92 transitions. Complement of second has 22 states. [2020-06-22 05:16:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 2 accepting loop states [2020-06-22 05:16:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 05:16:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2020-06-22 05:16:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 05:16:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:16:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 7 letters. Loop has 4 letters. [2020-06-22 05:16:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:16:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 05:16:12,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:16:12,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 92 transitions. [2020-06-22 05:16:12,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 05:16:12,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 35 states and 74 transitions. [2020-06-22 05:16:12,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-06-22 05:16:12,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-06-22 05:16:12,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 74 transitions. [2020-06-22 05:16:12,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 05:16:12,450 INFO L706 BuchiCegarLoop]: Abstraction has 35 states and 74 transitions. [2020-06-22 05:16:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 74 transitions. [2020-06-22 05:16:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2020-06-22 05:16:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-06-22 05:16:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2020-06-22 05:16:12,456 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-06-22 05:16:12,456 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2020-06-22 05:16:12,456 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 05:16:12,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. [2020-06-22 05:16:12,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-06-22 05:16:12,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:16:12,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:16:12,457 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 05:16:12,458 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-06-22 05:16:12,458 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY [78] ULTIMATE.startENTRY-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_main_~m~0_9) (= 0 v_ULTIMATE.start_main_~i~0_14) (<= 0 v_ULTIMATE.start_main_~n~0_8) (<= 0 v_ULTIMATE.start_main_~N~0_9)) InVars {} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_10, ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_9, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~m~0, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~N~0, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res] 291#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 305#L22-2 [66] L22-2-->L25-2: Formula: (and (= v_ULTIMATE.start_main_~j~0_6 (+ v_ULTIMATE.start_main_~j~0_7 1)) (= v_ULTIMATE.start_main_~k~0_5 v_ULTIMATE.start_main_~i~0_10) (< v_ULTIMATE.start_main_~j~0_7 v_ULTIMATE.start_main_~m~0_7)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_7, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_10, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_6, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~j~0] 292#L25-2 [77] L25-2-->L22-2: Formula: (and (<= v_ULTIMATE.start_main_~N~0_8 v_ULTIMATE.start_main_~k~0_9) (= v_ULTIMATE.start_main_~k~0_9 v_ULTIMATE.start_main_~i~0_13)) InVars {ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} OutVars{ULTIMATE.start_main_~k~0=v_ULTIMATE.start_main_~k~0_9, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, ULTIMATE.start_main_~N~0=v_ULTIMATE.start_main_~N~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 300#L22-2 [2020-06-22 05:16:12,458 INFO L796 eck$LassoCheckResult]: Loop: 300#L22-2 [75] L22-2-->L20-2: Formula: (and (= (+ v_ULTIMATE.start_main_~i~0_12 1) v_ULTIMATE.start_main_~i~0_11) (<= v_ULTIMATE.start_main_~m~0_8 v_ULTIMATE.start_main_~j~0_8)) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_8, ULTIMATE.start_main_~m~0=v_ULTIMATE.start_main_~m~0_8, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post6] 301#L20-2 [61] L20-2-->L22-2: Formula: (and (< v_ULTIMATE.start_main_~i~0_9 v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_main_~j~0_4 0)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 300#L22-2 [2020-06-22 05:16:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:16:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 3307963, now seen corresponding path program 2 times [2020-06-22 05:16:12,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:16:12,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:16:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:16:12,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:16:12,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:16:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:16:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:16:12,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:16:12,467 INFO L82 PathProgramCache]: Analyzing trace with hash 3347, now seen corresponding path program 2 times [2020-06-22 05:16:12,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:16:12,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:16:12,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:16:12,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:16:12,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:16:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:16:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:16:12,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:16:12,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1116012467, now seen corresponding path program 2 times [2020-06-22 05:16:12,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:16:12,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:16:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:16:12,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 05:16:12,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:16:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:16:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:16:12,507 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:16:12,507 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:16:12,507 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:16:12,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:16:12,507 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2020-06-22 05:16:12,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:16:12,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:16:12,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:16:12,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 05:16:12,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:16:12,508 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:16:12,509 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-22 05:16:12,511 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-22 05:16:12,516 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-22 05:16:12,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:16:12,544 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-22 05:16:12,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:16:12,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:16:12,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:16:12,553 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-22 05:16:12,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:16:12,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:16:12,584 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2020-06-22 05:16:12,584 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-22 05:16:12,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-06-22 05:16:12,611 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-22 05:16:12,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-06-22 05:16:12,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2020-06-22 05:16:13,241 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-06-22 05:16:13,244 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:16:13,244 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:16:13,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:16:13,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:16:13,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:16:13,244 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:16:13,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:16:13,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:16:13,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Loop [2020-06-22 05:16:13,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:16:13,245 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:16:13,246 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-22 05:16:13,248 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-22 05:16:13,253 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-22 05:16:13,282 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:16:13,283 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:16:13,283 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-22 05:16:13,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:16:13,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:16:13,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:16:13,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:16:13,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:16:13,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:16:13,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:16:13,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:16:13,286 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-22 05:16:13,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:16:13,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:16:13,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:16:13,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:16:13,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:16:13,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:16:13,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:16:13,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:16:13,289 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-22 05:16:13,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:16:13,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:16:13,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:16:13,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:16:13,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:16:13,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:16:13,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:16:13,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:16:13,297 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 05:16:13,297 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 05:16:13,298 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:16:13,298 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-06-22 05:16:13,298 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:16:13,298 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2020-06-22 05:16:13,299 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-06-22 05:16:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:16:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:16:13,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 05:16:13,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:16:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:16:13,324 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:16:13,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:16:13,333 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-22 05:16:13,334 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-06-22 05:16:13,334 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 2 loop predicates [2020-06-22 05:16:13,334 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32 Second operand 3 states. [2020-06-22 05:16:13,357 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states and 47 transitions. cyclomatic complexity: 32. Second operand 3 states. Result 34 states and 75 transitions. Complement of second has 6 states. [2020-06-22 05:16:13,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 05:16:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 05:16:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2020-06-22 05:16:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 2 letters. [2020-06-22 05:16:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:16:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2020-06-22 05:16:13,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:16:13,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 4 letters. [2020-06-22 05:16:13,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:16:13,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 75 transitions. [2020-06-22 05:16:13,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:16:13,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2020-06-22 05:16:13,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:16:13,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:16:13,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:16:13,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:16:13,363 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:16:13,363 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:16:13,363 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:16:13,363 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 05:16:13,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:16:13,363 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:16:13,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:16:13,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:16:13 BasicIcfg [2020-06-22 05:16:13,371 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:16:13,371 INFO L168 Benchmark]: Toolchain (without parser) took 16079.07 ms. Allocated memory was 649.6 MB in the beginning and 737.1 MB in the end (delta: 87.6 MB). Free memory was 565.2 MB in the beginning and 628.2 MB in the end (delta: -62.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,373 INFO L168 Benchmark]: CDTParser took 0.15 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-22 05:16:13,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.78 ms. Allocated memory was 649.6 MB in the beginning and 663.7 MB in the end (delta: 14.2 MB). Free memory was 565.2 MB in the beginning and 627.5 MB in the end (delta: -62.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.83 ms. Allocated memory is still 663.7 MB. Free memory was 627.5 MB in the beginning and 626.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,375 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 ms. Allocated memory is still 663.7 MB. Free memory was 626.4 MB in the beginning and 624.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,375 INFO L168 Benchmark]: RCFGBuilder took 229.69 ms. Allocated memory is still 663.7 MB. Free memory was 624.2 MB in the beginning and 609.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,376 INFO L168 Benchmark]: BlockEncodingV2 took 89.94 ms. Allocated memory is still 663.7 MB. Free memory was 609.7 MB in the beginning and 603.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,376 INFO L168 Benchmark]: TraceAbstraction took 160.78 ms. Allocated memory is still 663.7 MB. Free memory was 603.2 MB in the beginning and 594.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,377 INFO L168 Benchmark]: BuchiAutomizer took 15249.56 ms. Allocated memory was 663.7 MB in the beginning and 737.1 MB in the end (delta: 73.4 MB). Free memory was 593.5 MB in the beginning and 628.2 MB in the end (delta: -34.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 50.3 GB. [2020-06-22 05:16:13,381 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 11 locations, 17 edges - StatisticsResult: Encoded RCFG 4 locations, 6 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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.78 ms. Allocated memory was 649.6 MB in the beginning and 663.7 MB in the end (delta: 14.2 MB). Free memory was 565.2 MB in the beginning and 627.5 MB in the end (delta: -62.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.83 ms. Allocated memory is still 663.7 MB. Free memory was 627.5 MB in the beginning and 626.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.45 ms. Allocated memory is still 663.7 MB. Free memory was 626.4 MB in the beginning and 624.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 229.69 ms. Allocated memory is still 663.7 MB. Free memory was 624.2 MB in the beginning and 609.7 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 89.94 ms. Allocated memory is still 663.7 MB. Free memory was 609.7 MB in the beginning and 603.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 160.78 ms. Allocated memory is still 663.7 MB. Free memory was 603.2 MB in the beginning and 594.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 15249.56 ms. Allocated memory was 663.7 MB in the beginning and 737.1 MB in the end (delta: 73.4 MB). Free memory was 593.5 MB in the beginning and 628.2 MB in the end (delta: -34.7 MB). Peak memory consumption was 38.7 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: 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, 3 LocationsWithAnnotation, 3 PreInvPairs, 3 NumberOfFragments, 3 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (0 trivial, 0 deterministic, 5 nondeterministic). One nondeterministic module has affine ranking function n + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 3 locations. One nondeterministic module has affine ranking function -1 * j + m and consists of 3 locations. One nondeterministic module has affine ranking function n + -1 * k and consists of 8 locations. One nondeterministic module has affine ranking function -1 * i + n and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.2s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 14.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 4. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 40 SDtfs, 47 SDslu, 7 SDs, 0 SdLazy, 65 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp69 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf92 smp100 dnf100 smp100 tf112 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:15:54.062 ----------------------------------------------- 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-22 05:16:13.613 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check